Finite automata, their algebras, and grammars : towards a theory of formal expressions
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540969051
3540969055
9780387969053
0387969055
- Dimensions
-
25 cm
- Extent
-
XXII, 316 S.
- Language
-
Englisch
- Notes
-
88 graph. Darst.
Literaturverz. S. 299 - 303
- Keyword
-
Endlicher Automat
Automatentheorie
Automatentheorie
- Event
-
Veröffentlichung
- (where)
-
New York, Berlin, Heidelberg, London, Paris, Tokyo, Hong Kong
- (who)
-
Springer
- (when)
-
1989
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.03.2025, 12:30 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Büchi, Julius Richard
- Springer
Time of origin
- 1989
Other Objects (12)
On the Relative Descriptional Complexity of Regular Expressions and Finite Automata
Finite dimensional algebras
Transformation Between Regular Expressions and omega-Automata
Self-Assembling Finite Automata
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
Finite horizon analysis of Markov automata
Randomization in Non-Uniform Finite Automata
Finite automata and application to cryptography
Weighted Finite Automata over Strong Bimonoids
Minimizing finite automata is computationally hard
On the Relative Descriptional Complexity of Regular Expressions and Finite Automata
Finite dimensional algebras
Transformation Between Regular Expressions and omega-Automata
Self-Assembling Finite Automata
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
Finite horizon analysis of Markov automata
Randomization in Non-Uniform Finite Automata
Finite automata and application to cryptography
Weighted Finite Automata over Strong Bimonoids
Minimizing finite automata is computationally hard
On the Relative Descriptional Complexity of Regular Expressions and Finite Automata
Finite dimensional algebras
Transformation Between Regular Expressions and omega-Automata
Self-Assembling Finite Automata
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
Finite horizon analysis of Markov automata
Randomization in Non-Uniform Finite Automata
Finite automata and application to cryptography
Weighted Finite Automata over Strong Bimonoids