Finite Automata, Their Algebras and Grammars Towards a Theory of Formal Expressions
The author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science. In the first part of the book he presents the new classical theory of finite automata as unary algebras which he himself invented about 30 years ago. Many res...
Main Author: | |
---|---|
Other Authors: | |
Format: | eBook |
Language: | English |
Published: |
New York, NY
Springer New York
1989, 1989
|
Edition: | 1st ed. 1989 |
Subjects: | |
Online Access: | |
Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- 1 Concepts and Notations in Discrete Mathematics
- 2 The Structure Theory of Transition Algebras
- 3 The Structure and Behavior of Finite Automata
- 4 Transition Systems and Regular Events
- 5 Regular Canonical Systems
- 6 General Algebras: How They Function as Tree Acceptors and Push-down Automata
- 7 General Alphabets: The Theory of Push-down Automata and Context-free Languages
- Conclusion
- List of Symbols
- References