| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910586636603321 |
|
|
Autore |
Pettorossi Alberto |
|
|
Titolo |
Automata Theory and Formal Languages : Fundamental Notions, Theorems, and Techniques / / by Alberto Pettorossi |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
|
|
|
|
|
|
|
|
|
ISBN |
|
9783031119651 |
9783031119644 |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2022.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (287 pages) |
|
|
|
|
|
|
Collana |
|
Undergraduate Topics in Computer Science, , 2197-1781 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Machine theory |
Computer science |
Computable functions |
Recursion theory |
Formal Languages and Automata Theory |
Computer Science Logic and Foundations of Programming |
Computability and Recursion Theory |
Theory and Algorithms for Application Domains |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di contenuto |
|
1 Formal Grammars and Languages -- 2 Finite Automata and Regular Grammars -- 3 Pushdown Automata and Context-Free Grammars -- 4 Linear Bounded Automata and Context-Sensitive Grammars -- 5 Turing Machines and Type 0 Grammars -- 6 Decidability and Undecidability in Context-Free Languages -- 7 Supplementary Topics. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
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; linearbounded 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 correspondences Presents some fundamental techniques for parsing both regular and context-free languages Classifies subclasses of decidable problems, avoiding focus on the theory of complexity Examines finite-automata minimalization and characterization of their behavior using regular expressions Illustrates how to derive grammars of context-free languages in Chomsky and Greibach normal forms Offers supplementary material on counter machines, stack automata, and abstract language families This highly useful, varied text/reference is suitable for undergraduate and graduate courses 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. |
|
|
|
|
|
| |