Automata theory and formal languages : fundamental notions, theorems and techniques /
Alberto Pettorossi
- Switzerland : Springer, c2022
- vii, 280 leaves ; 26 cm.
- Undergraduate Topics in Computer Science .
Includes bibliographical references and index.
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.
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.