An Introduction to Formal Languages and AutomataJones & Bartlett Learning, 2016 M01 12 - 450 pages The Sixth Edition of An Introduction to Formal Languages and Automata provides an accessible, student-friendly presentation of all material essential to an introductory Theory of Computation course. Written to address the fundamentals of formal languages, automata, and computability, the text is designed to familiarize students with the foundations and principles of computer science and to strengthen the students' ability to carry out formal and rigorous mathematical arguments. The author, Peter Linz, continues to offer a straightforward, uncomplicated treatment of formal languages and automata and avoids excessive mathematical detail so that students may focus on and understand the underlying principles. |
Other editions - View all
Common terms and phrases
accepts the language alphabet anbn argument chapter closure complete computation configuration construction context context-free grammar countable defined definition denoted derivation tree deterministic context-free language DTIME edge equivalent Exercise final Find finite accepter following languages given grammar G Greibach normal form halting problem induction input symbol instantaneous descriptions integers L1 and L2 labeled language accepted language families leftmost length linear bounded automaton Mealy machine membership algorithm Moore machine move MPC solution nondeterminism nondeterministic npda number of a’s output parsing Post correspondence problem Post system primitive recursive productions programming languages proof pumping lemma pushdown automata read-write head recursively enumerable languages regular expression regular grammar regular languages result Section sentential form sequence Show shown in Figure simple simulation stack standard Turing machine step subset tape Theorem transducer transition function transition graph undecidable unit-productions unrestricted grammar variable vertex