- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0525
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Finite automata with undirected state graphs ; day:24 ; month:5 ; year:2021 ; pages:1-19
Acta informatica ; (24.5.2021), 1-19
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00236-021-00402-0
- URN
-
urn:nbn:de:101:1-2021092022312812694273
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:20 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Kutrib, Martin
- Malcher, Andreas
- Schneider, Christian
- SpringerLink (Online service)
Ähnliche Objekte (12)
Self-Assembling Finite Automata
Automata arrays and context-free languages
State Complexity of Basic Operations on Nondeterministic Finite Automata
Efficient universal pushdown cellular automata and their application to complexity
Kellererweiterte Polyautomaten
Self-verifying cellular automata
Fast One-Way Cellular Automata
Cellular automata with sparse communication
One-dimensional pattern generation by cellular automata
Flip-Pushdown Automata: Nondeterminism is Better Than Determinism
A Time Hierarchy for Bounded One-Way Cellular Automata
On time computability of functions in one-way cellular automata
Self-Assembling Finite Automata
Automata arrays and context-free languages
State Complexity of Basic Operations on Nondeterministic Finite Automata
Efficient universal pushdown cellular automata and their application to complexity
Kellererweiterte Polyautomaten
Self-verifying cellular automata
Fast One-Way Cellular Automata
Cellular automata with sparse communication
One-dimensional pattern generation by cellular automata
Flip-Pushdown Automata: Nondeterminism is Better Than Determinism
A Time Hierarchy for Bounded One-Way Cellular Automata
On time computability of functions in one-way cellular automata
Self-Assembling Finite Automata
Automata arrays and context-free languages
State Complexity of Basic Operations on Nondeterministic Finite Automata
Efficient universal pushdown cellular automata and their application to complexity
Kellererweiterte Polyautomaten
Self-verifying cellular automata
Fast One-Way Cellular Automata
Cellular automata with sparse communication
One-dimensional pattern generation by cellular automata
Flip-Pushdown Automata: Nondeterminism is Better Than Determinism
A Time Hierarchy for Bounded One-Way Cellular Automata