An introduction to formal languages and automata / Peter Linz, Susan H. Rodger.

Peter Linz is Professor Emeritus in the Department of Computer Science at the University of California, Davis. Linz received his Ph.D. from the University of Wisconsin. Professor Linz's research emphasizes the development of a theory of numerical analysis that can be used in the construction of reliable numerical methods used in the design of problem-solving environments for scientific computing. Linz has released the seventh edition of An Introduction to Formal Languages and Automata, as well as Exploring Numerical Methods: An Introduction to Scientific Computing.


Susan H. Rodger, PhD - Duke University
Susan H. Rodger is Professor of the Practice of Computer Science at Duke University. She received her Ph.D. in Computer Science from Purdue University. Rodger works in the area of computer science education. Her major contributions are in visualization and interaction software for education in theoretical computer science, computing in K-12 and peer-led team learning. Rodger developed JFLAP, software for experimenting with formal languages and automata. JFLAP is the leading educational tool for formal languages and automata theory and has been used around the world for over thirty years in several types of courses including formal languages and automata, compilers, artificial intelligence, and discrete mathematics. Rodger is a leader in integrating computing into K-12 with the Adventures in Alice Programming project. Rodger received the IEEE Computer Society 2019 Taylor L. Booth Education Award, ACM 2013 Karl V. Karlstrom Outstanding Educator Award, Duke University Trinity College 2019 David and Janet Vaughn Brooks Distinguished Teaching Award, and she was one of two finalist candidates for the NEEDS Premier Award for Excellence in Engineering Education Courseware for the software JFLAP.

Includes bibliographical references and index.

Introduction to the theory of computation -- Finite automata -- Regular languages and regular grammars -- Properties of regular languages -- Context-free languages -- Simplification of context-free grammars and normal forms -- Pushdown automata -- Properties of context-free languages -- Turing machines -- Other models of turing machines -- A hierarchy of formal languages and automata -- Limits of algorithmic computation -- Other models of computation -- An overview of computational complexity -- Compilers and parsing -- LL parsing -- LR parsing.

An Introduction to Formal Languages and Automata, Seventh Edition is designed for an introductory course on formal languages, automata, computability, and related matters forming what is known as the theory of computation. The text takes a problem-solving approach, in which students' abilities are tested at various levels.

The Seventh Edition familiarizes students with the foundations and principles of computer science, teaches material useful in subsequent courses, and strengthens students' ability to carry out formal and rigorous mathematical arguments. Provided by publisher.