The impact of alphabet size on pattern complexity of maxmin- $$\omega$$ ω cellular automata
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1572-9796
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
The impact of alphabet size on pattern complexity of maxmin- $$\omega$$ ω cellular automata ; volume:19 ; number:2 ; day:14 ; month:4 ; year:2020 ; pages:273-285 ; date:6.2020
Natural computing ; 19, Heft 2 (14.4.2020), 273-285, 6.2020
- Urheber
-
Patel, Ebrahim L.
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s11047-020-09787-2
- URN
-
urn:nbn:de:101:1-2020080200290836180119
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:57 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
- Patel, Ebrahim L.
- SpringerLink (Online service)
Ähnliche Objekte (12)
On complexity of colloid cellular automata
Complexity-theoretic aspects of expanding cellular automata
Descriptional complexity of cellular automata and decidability questions
Relationship between Alternating omega-Automata and Symbolically Represented Nondeterministic omega-Automata
Sublinear-Time Cellular Automata and Connections to Complexity Theory
Efficient universal pushdown cellular automata and their application to complexity
Polynomial Identification of $\omega$-Automata
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
On complexity of colloid cellular automata
Complexity-theoretic aspects of expanding cellular automata
Descriptional complexity of cellular automata and decidability questions
Relationship between Alternating omega-Automata and Symbolically Represented Nondeterministic omega-Automata
Sublinear-Time Cellular Automata and Connections to Complexity Theory
Efficient universal pushdown cellular automata and their application to complexity
Polynomial Identification of $\omega$-Automata
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
On complexity of colloid cellular automata
Complexity-theoretic aspects of expanding cellular automata
Descriptional complexity of cellular automata and decidability questions
Relationship between Alternating omega-Automata and Symbolically Represented Nondeterministic omega-Automata
Sublinear-Time Cellular Automata and Connections to Complexity Theory
Efficient universal pushdown cellular automata and their application to complexity
Polynomial Identification of $\omega$-Automata
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings