- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783764337193
3764337192
9780817637194
0817637192
- Dimensions
-
25 cm
- Extent
-
XII, 226 S.
- Language
-
Deutsch
- Notes
-
Literaturverz. S. 217 - 222
- Bibliographic citation
-
Progress in theoretical computer science ; 11
- Keyword
-
Endlicher Automat
Mathematische Logik
Halbgruppentheorie
Komplexitätstheorie
- Event
-
Veröffentlichung
- (where)
-
Boston, Basel, Berlin
- (who)
-
Birkhäuser
- (when)
-
1994
- 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:18 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
- Straubing, Howard
- Birkhäuser
Time of origin
- 1994
Other Objects (12)
State Complexity of Basic Operations on Nondeterministic Finite Automata
Languages, automata, and logic
On the Relative Descriptional Complexity of Regular Expressions and Finite Automata
Self-Assembling Finite Automata
Logic and complexity
Circuit Complexity in Z2 EEFT
Logic circuit design : selected methods
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
A note on the computational complexity of some problems for self-verifying finite automata
Characterising QBF Hardness via Circuit Complexity
State Complexity of Basic Operations on Nondeterministic Finite Automata
Languages, automata, and logic
On the Relative Descriptional Complexity of Regular Expressions and Finite Automata
Self-Assembling Finite Automata
Logic and complexity
Circuit Complexity in Z2 EEFT
Logic circuit design : selected methods
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
A note on the computational complexity of some problems for self-verifying finite automata
Characterising QBF Hardness via Circuit Complexity
State Complexity of Basic Operations on Nondeterministic Finite Automata
Languages, automata, and logic
On the Relative Descriptional Complexity of Regular Expressions and Finite Automata
Self-Assembling Finite Automata
Logic and complexity
Circuit Complexity in Z2 EEFT
Logic circuit design : selected methods
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
A note on the computational complexity of some problems for self-verifying finite automata