Automata Theory
Seiten
1999
World Scientific Publishing Co Pte Ltd (Verlag)
978-981-02-3754-7 (ISBN)
World Scientific Publishing Co Pte Ltd (Verlag)
978-981-02-3754-7 (ISBN)
- Keine Verlagsinformationen verfügbar
- Artikel merken
This volume covers the central areas 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 examples and special attention is given to semi-automata theory.
This volume covers substantially the central areas 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 examples. Special attention is given to semi-automata theory - the relationship between semigroups and sequential machines (including Green's relations), Schutzenberger'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 linited 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.
This volume covers substantially the central areas 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 examples. Special attention is given to semi-automata theory - the relationship between semigroups and sequential machines (including Green's relations), Schutzenberger'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 linited 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.
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.
| Erscheint lt. Verlag | 31.5.1999 |
|---|---|
| Verlagsort | Singapore |
| Sprache | englisch |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Angewandte Mathematik |
| Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
| Technik ► Elektrotechnik / Energietechnik | |
| ISBN-10 | 981-02-3754-5 / 9810237545 |
| ISBN-13 | 978-981-02-3754-7 / 9789810237547 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 62,95
Anwendungen und Theorie von Funktionen, Distributionen und Tensoren
Buch | Softcover (2023)
De Gruyter Oldenbourg (Verlag)
CHF 97,90
