Automata theory is the oldest among the disciplines constituting the subject matter of this Monograph Series: theoretical computer science. Indeed, automata theory and the closely related theory of formal languages form nowadays such a highly developed and diversified body of knowledge that even an exposition of "reasonably important" results is not possible within one volume. The purpose of this book is to develop the theory of automata and formal languages, starting from ideas based on linear algebra. By what was said above, it should be obvious that we do not intend to be encyclopedic. However, this book contains the basics of regular and context-free languages (including some new results), as well as a rather complete theory of pushdown automata and variations (e. g. counter automata). The wellknown AFL theory is extended to power series ("AFP theory"). Additional new results include, for instance, a grammatical characterization of the cones and the principal cones of context-free languages, as well as new decidability results.
Reihe
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Illustrationen
Gewicht
ISBN-13
978-3-540-13716-0 (9783540137160)
DOI
10.1007/978-3-642-69959-7
Schweitzer Klassifikation
I. Linear Algebra.- 1. Semirings and Power Series.- 2. Convergence, Equations and Identities.- 3. Strong Convergence and Cycle-Free Power Series.- 4. Matrices, Linear Systems and Identities.- 5. Semirings with Particular Properties.- 6. Morphisms and Representations.- II. Automata.- 7. Automata in Terms of Matrices.- 8. Rational Power Series and Decidability.- 9. Rational Transductions.- 10. Pushdown Automata.- 11. Abstract Families of Power Series.- 12. Substitutions.- 13. Reset Pushdown Automata and Counter Automata.- III. Algebraic Systems.- 14. Algebraic Series and Context-Free Languages.- 15. The Super Normal Form.- 16. Commuting Variables: Decidability and Parikh's Theorem.- Historical and Bibliographical Remarks.- References.- Symbol Index.
