- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1572-9796
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Complexity-theoretic aspects of expanding cellular automata ; day:10 ; month:11 ; year:2020 ; pages:1-13
Natural computing ; (10.11.2020), 1-13
- Creator
-
Modanese, Augusto
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s11047-020-09814-2
- URN
-
urn:nbn:de:101:1-2020122122172978569060
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:37 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
- Modanese, Augusto
- SpringerLink (Online service)
Other Objects (12)
On complexity of colloid cellular automata
Descriptional complexity of cellular automata and decidability questions
Descriptive set theoretic methods in automata theory : decidability and topological complexity
Sublinear-Time Cellular Automata and Connections to Complexity Theory
Efficient universal pushdown cellular automata and their application to complexity
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Sequentializing cellular automata
On complexity of colloid cellular automata
Descriptional complexity of cellular automata and decidability questions
Descriptive set theoretic methods in automata theory : decidability and topological complexity
Sublinear-Time Cellular Automata and Connections to Complexity Theory
Efficient universal pushdown cellular automata and their application to complexity
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Sequentializing cellular automata
On complexity of colloid cellular automata
Descriptional complexity of cellular automata and decidability questions
Descriptive set theoretic methods in automata theory : decidability and topological complexity
Sublinear-Time Cellular Automata and Connections to Complexity Theory
Efficient universal pushdown cellular automata and their application to complexity
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings
Cellular automata : proceedings