Inicio > > Ciencias de la computación > Automata Theory and Formal Languages
Automata Theory and Formal Languages

Automata Theory and Formal Languages

Alberto Pettorossi

49,60 €
IVA incluido
Disponible
Editorial:
Springer Nature B.V.
Año de edición:
2022
Materia
Ciencias de la computación
ISBN:
9783031119668
49,60 €
IVA incluido
Disponible

Selecciona una librería:

  • Librería Samer Atenea
  • Librería Aciertas (Toledo)
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)

Knowledge of automata theory and formal languages is crucial for understanding human-computer interaction, as well as for understanding the various processes that take place when manipulating knowledge if that knowledge is, indeed, expressed as sentences written in a suitably formalized language. In particular, it is at the basis of the theory of parsing, which plays an important role in language translation, compiler construction, and knowledge manipulation in general.Presenting basic notions and fundamental results, this concise textbook is structured on the basis of a correspondence that exists between classes of automata and classes of languages. That correspondence is established by the fact that the recognition and the manipulation of sentences in a given class of languages can be done by an automaton in the corresponding class of automata. Four central chapters center on: finite automata and regular languages; pushdown automata and context-free languages; linear bounded automata and context-sensitive languages; and Turing machines and type 0 languages.  The book also examines decidable and undecidable problems with emphasis on the case for context-free languages.Topics and features:Provides theorems, examples, and exercises to clarify automata-languages correspondencesPresents some fundamental techniques for parsing both regular and context-free languagesClassifies subclasses of decidable problems, avoiding focus on the theory of complexityExamines finite-automata minimalization and characterization of their behavior using regular expressionsIllustrates how to derive grammars of context-free languages in Chomsky and Greibach normal formsOffers supplementary material on counter machines, stack automata, and abstract language familiesThis highly useful, varied text/reference is suitable for undergraduate and graduatecourses on automata theory and formal languages, and assumes no prior exposure to these topics nor any training in mathematics or logic.Alberto Pettorossi is professor of theoretical computer science at the University of Rome Tor Vergata, Rome, Italy.

Artículos relacionados

Otros libros del autor

  • Techniques for Searching, Parsing, and Matching
    Alberto Pettorossi
    In this book the author presents some techniques for exploring trees and graphs. He illustrates the linear search technique and the backtracking technique, and as instances of tree exploration methods he presents various algorithms for parsing subclasses of context-free languages. He also illustrates some tree and graph exploration and manipulation methods by presenting, among ...
    Disponible

    97,66 €

  • Techniques for Searching, Parsing, and Matching
    Alberto Pettorossi
    In this book the author presents some techniques for exploring trees and graphs. He illustrates the linear search technique and the backtracking technique, and as instances of tree exploration methods he presents various algorithms for parsing subclasses of context-free languages. He also illustrates some tree and graph exploration and manipulation methods by presenting, among ...
    Disponible

    49,70 €

  • Techniques for Searching, Parsing, and Matching
    Alberto Pettorossi
    In this book the author presents some techniques for exploring trees and graphs. He illustrates the linear search technique and the backtracking technique, and as instances of tree exploration methods he presents various algorithms for parsing subclasses of context-free languages. He also illustrates some tree and graph exploration and manipulation methods by presenting, among ...
  • Logic Based Program Synthesis and Transformation
    Alberto Pettorossi
    This book constitutes the thoroughly refereed post-proceedings of the 11th International Workshop on Logic-Based Program Synthesis and Transformation, LOPSTR 2001, held in Paphos, Cyprus, in November 2001.The 13 revised full papers presented together with an invited paper were carefully selected and improved during two rounds of reviewing and revision...
    Disponible

    77,70 €

  • Meta-Programming in Logic
    Alberto Pettorossi
    This volume contains lectures and papers delivered at Meta 92, the Third International Workshop on Metaprogramming in Logic, held in Uppsala, Sweden,June 1992. The topics covered include foundations of metaprogramming in logic, proposals for metaprogramming languages, techniques for knowledgerepresentation and belief systems, and program transf...
    Disponible

    65,88 €