Sequentializing cellular automata

Sequentializing cellular automata

We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be written as a single sweep of a bijective rule from left to right o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Natural computing 2020-12, Vol.19 (4), p.759-772
Hauptverfasser: Kari, Jarkko, Salo, Ville, Worsch, Thomas
Format: Artikel
Sprache:eng
Schlagworte:
Artificial Intelligence
Cellular automata
Complex Systems
Computer Science
Evolutionary Biology
Permutations
Processor Architectures
Simulation
Theory of Computation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be written as a single sweep of a bijective rule from left to right over an infinite tape. Such cellular automata are necessarily left-closing, and they move at least as much information to the left as they move information to the right.
ISSN:1567-7818
1572-9796
DOI:10.1007/s11047-019-09745-7