The Size of One-Way Cellular Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2010

The Size of One-Way Cellular Automata

Martin Kutrib
  • Function : Author
  • PersonId : 884118
Andreas Malcher
  • Function : Author
  • PersonId : 884119


We investigate the descriptional complexity of basic operations on real-time one-way cellular automata with an unbounded as well well as a fixed number of cells. The size of the automata is measured by their number of states. Most of the bounds shown are tight in the order of magnitude, that is, the sizes resulting from the effective constructions given are optimal with respect to worst case complexity. Conversely, these bounds also show the maximal savings of size that can be achieved when a given minimal real-time OCA is decomposed into smaller ones with respect to a given operation. From this point of view the natural problem of whether a decomposition can algorithmically be solved is studied. It turns out that all decomposition problems considered are algorithmically unsolvable. Therefore, a very restricted cellular model is studied in the second part of the paper, namely, real-time one-way cellular automata with a fixed number of cells. These devices are known to capture the regular languages and, thus, all the problems being undecidable for general one-way cellular automata become decidable. It is shown that these decision problems are $\textsf{NLOGSPACE}$-complete and thus share the attractive computational complexity of deterministic finite automata. Furthermore, the state complexity of basic operations for these devices is studied and upper and lower bounds are given.
Fichier principal
Vignette du fichier
dmAL0106.pdf (435.03 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01185494 , version 1 (20-08-2015)



Martin Kutrib, Jonas Lefèvre, Andreas Malcher. The Size of One-Way Cellular Automata. Automata 2010 - 16th Intl. Workshop on CA and DCS, 2010, Nancy, France. pp.71-90, ⟨10.46298/dmtcs.2758⟩. ⟨hal-01185494⟩
308 View
571 Download



Gmail Facebook X LinkedIn More