An introduction to formal languages and automata /
Peter Linz
- Fifth Edition
- Sudbury, Massachusetts : Jone and Bartlett Learning, c2012
- xiii, 437 pages : illustrations ; 24 cm.
Includes bibliographical references and index.
1. Introduction to the theory of computation -- 2. Finite automata -- 3. Regular languages and regular grammars -- 4. Properties of regular language -- 5. Context-free languages -- 6. Simplification of context-free grammars and normal forms -- 7. Pushdown automata -- 8. Properties of context-free languages -- 9. Turing machines -- 10. Other models of Turing machines -- 11. A hierarchy of formal language and automata -- 12. Limits of algorithmic computation -- 13. Other models of computation -- 14. An overview of computational complexity.
This book is designed for an introductory course on formal languages, automata, computability, and related matters.