This book covers substantially the central ideas of a one semester course in automata theory. It is oriented towards a mathematical perspective that is understandable to non-mathematicians. Comprehension is greatly aided by many examples, especially on the Chomsky — Schützenberger theorem, which is not found in most books in this field. Special attention is given to semiautomata theory: the relationship between semigroups and sequential machines (including Green's relations), Schützenberger's maximal subgroup, von Neumann inverses, wreath products, transducers using matrix notation, shuffle and Kronecker shuffle products. Methods of formal power series, the ambiguity index and linear languages are discussed. Core material includes finite state automata, regular expressions, Kleene's theorem, Chomsky's hierarchy and transformations of grammars. Ambiguous grammars (not limited to context-free grammars) and modal logics are briefly discussed. Turing machine variants with many examples, pushdown automata and their state transition diagrams and parsers, linear-bounded automata/2-PDA and Kuroda normal form are also discussed. A brief study of Lindenmeyer systems is offered as a comparison to the theory of Chomsky.
Sample Chapter(s)
Chapter 0: Mathematical Preliminaries (184 KB)
Contents:
- Mathematical Preliminaries
- Sequential Machines
- Finite State Automata
- Chomsky Grammars
- Formal Power Series
- Turing Machines
- Pushdown Automata
- Context-Sensitive (Type-1) Languages
- Lindenmeyer (Developmental) L Systems, Syntactic Pattern Recognition and Shape Grammars
Readership: Colleges offering a good mathematics program.
