Automata TheoryWorld Scientific Publishing Company, 29 de abr. de 1999 - 440 páginas 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. |
Conteúdo
1 | |
5 | |
Chapter 2 Finite State Automata | 99 |
Chapter 3 Chomsky Grammars | 147 |
Chapter 4 Formal Power Series | 215 |
Chapter 5 Turing Machines | 249 |
Chapter 6 Pushdown Automata | 299 |
Chapter 7 ContextSensitive Type1 Languages | 329 |
Chapter 8 Lindenmeyer Developmental Systems Syntactic Pattern Recognition Shape Grammars | 369 |
Appendices | 387 |
References | 419 |
422 | |
425 | |
Outras edições - Ver todos
Termos e frases comuns
A A B a b a b algebraic Automata Theory Chapter Chomsky Chomsky Normal Form compute construct context-free grammar context-free languages context-sensitive Definition deterministic DFSA equivalent Example Figure finite set Finite State Automata formal power series given the following grammar G halt homomorphism idempotent input string inverse Kuroda Normal Form linear Linear-Bounded automaton LR(k matrix Maximal Subgroup Modal Logics monoid NDFSA non-terminal Normal Form Note ºs ºs ºs parser polynomial production rules Pushdown Automaton recursive regular expressions Schützenberger Schutzenberger Maximal Subgroup semigroup Sequential Machines ſº stack sub-Turing machines symbols tape Theorem transition table Turing machine vºo wºo yx yx