World Scientific, 1999 - 428 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.
O que estão dizendo - Escrever uma resenha
Não encontramos nenhuma resenha nos lugares comuns.
Finite State Automata
Formal Power Series
ContextSensitive Type1 Languages
Lindenmeyer Developmental 4 Systems Syntactic
Turing Machine and Complexity
Outras edições - Visualizar todos
accept algebraic associated Automata automaton becomes called Chapter Chomsky compute Consider construct contains context-free context-sensitive continued corresponds covered defined Definition Design deterministic elements equivalent Example exists field Figure final finite Formal functions Given grammar halt hand idempotent identity input inverse language length linear means method Modal Logics monoid move Negro non-terminal Normal Form Note obtain possible problem production rules proof pushdown recursive refer regular expressions replace result semigroup side simple stack Step string studied subgroup symbols Systems tape terminal Theorem Theory transition Turing machine viewed