Presents easily accessible coverage of language theory, concentrating on the major properties of the fundamental and automata models for languages. Focuses on practical applications such as finite automata and pattern matching, regular expressions and text editing, extended context-free grammars, and syntax diagrams. Simple and elegant proofs are given for theorems usually considered difficult (e.g., Parikh's theorem or the proof that every finite automata has an equivalent regular expression). Provides algorithms in a Pascal-like notation which complement discussions of constructions and programming. Each chapter includes a springboard section introducing topics for further investigation. Also provides short exercises and programming projects plus extensive examples.
"synopsis" may belong to another edition of this title.
Book Description Longman Higher Education, 1986. Hardcover. Book Condition: New. Bookseller Inventory # DADAX0060472081