Semirings, Automata, Languages
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...
| Main Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1986, 1986
|
| Edition: | 1st ed. 1986 |
| Series: | Monographs in Theoretical Computer Science. An EATCS Series
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- 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