An Introduction to Formal Languages and Automata
An Introduction to Formal Languages & Automata provides an excellent presentation of the material that is essential to an introductory theory of computation course. The text was designed to familiarize students with the foundations & principles of computer science & to strengthen the students' ability to carry out formal & rigorous mathematical argument. Employing a problem-solving approach, the text provides students insight into the course material by stressing intuitive motivation & illustration of ideas through straightforward explanations & solid mathematical proofs. By emphasizing learning through problem solving, students learn the material primarily through problem-type illustrative examples that show the motivation behind the concepts, as well as their connection to the theorems & definitions.
What people are saying - Write a review
We haven't found any reviews in the usual places.
accepts the language alphabet argument assume closure complete computation configuration Consider construction context-free grammar context-sensitive languages control unit countable defined definition denoted derivation tree dfa's edge equivalent Example Exercise exists family of regular final Find finite accepter finite number following languages formal Give given grammar G Greibach normal form guage halting problem induction integers labeled language accepted language families languages is closed leftmost length Let G linear bounded automaton move na(w nb(w nondeterminism nondeterministic notation npda parsing PC-solution Post correspondence problem Post system primitive recursive productions programming languages proof Prove pumping lemma pushdown automata read-write head recursively enumerable languages regular expression regular grammar regular languages restricted result sentential form sequence Show shown in Figure simple simulation stack standard Turing machine step subset substring tape terminal Theorem tion transition function transition graph undecidable unit-productions unrestricted grammar variable vertex w e L(G