The impact of alphabet size on pattern complexity of maxmin- $$\omega$$ ω cellular automata
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1572-9796
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
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
- Creator
-
Patel, Ebrahim L.
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s11047-020-09787-2
- URN
-
urn:nbn:de:101:1-2020080200290836180119
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:57 AM CEST
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
- Patel, Ebrahim L.
- SpringerLink (Online service)
Other Objects (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