Shrinking One-Way Cellular Automata - Cellular Automata and Discrete Complex Systems Access content directly
Conference Papers Year : 2015

Shrinking One-Way Cellular Automata

Abstract

We investigate cellular automata as acceptors for formal languages. In particular, we consider real-time one-way cellular automata ( OCA ) with the additional property that during a computation any cell of the OCA has the ability to dissolve itself and we call this model shrinking one-way cellular automata ( SOCA ). It turns out that real-time SOCA are more powerful than real-time OCA , since they can accept certain linear-time OCA languages. Additionally, a construction is provided that enables real-time SOCA to accept the reversal of real-time iterative array languages. Finally, restricted real-time SOCA are investigated which are allowed to dissolve only a number of cells that is bounded by some function. In this case, an infinite strict hierarchy of language classes is obtained.
Fichier principal
Vignette du fichier
338243_1_En_11_Chapter.pdf (391.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01442469 , version 1 (20-01-2017)

Licence

Attribution

Identifiers

Cite

Martin Kutrib, Andreas Malcher, Matthias Wendlandt. Shrinking One-Way Cellular Automata. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. pp.141-154, ⟨10.1007/978-3-662-47221-7_11⟩. ⟨hal-01442469⟩
166 View
169 Download

Altmetric

Share

Gmail Facebook X LinkedIn More