Complexity-Theoretic Aspects of Expanding Cellular Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Complexity-Theoretic Aspects of Expanding Cellular Automata

Augusto Modanese
  • Function : Author
  • PersonId : 1055819

Abstract

The expanding cellular automata (XCA) variant of cellular automata is investigated and characterized from a complexity-theoretical standpoint. The respective polynomial-time complexity class is shown to coincide with , that is, the class of decision problems polynomial-time truth-table reducible to problems in . Corollaries on select XCA variants are proven: XCAs with multiple accept and reject states are shown to be polynomial-time equivalent to the original XCA model. Meanwhile, XCAs with diverse acceptance behavior are classified in terms of and the Turing machine polynomial-time class .
Fichier principal
Vignette du fichier
484947_1_En_2_Chapter.pdf (459.79 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02312620 , version 1 (11-10-2019)

Licence

Attribution

Identifiers

Cite

Augusto Modanese. Complexity-Theoretic Aspects of Expanding Cellular Automata. 25th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2019, Guadalajara, Mexico. pp.20-34, ⟨10.1007/978-3-030-20981-0_2⟩. ⟨hal-02312620⟩
30 View
16 Download

Altmetric

Share

Gmail Facebook X LinkedIn More