Iterative Arrays with Self-verifying Communication Cell - Cellular Automata and Discrete Complex Systems Access content directly
Conference Papers Year : 2019

Iterative Arrays with Self-verifying Communication Cell

Abstract

We study the computational capacity of self-verifying iterative arrays ($$\text {SVIA}$$). A self-verifying device is a nondeterministic device whose nondeterminism is symmetric in the following sense. Each computation path can give one of the answers yes, no, or do not know. For every input word, at least one computation path must give either the answer yes or no, and the answers given must not be contradictory. It turns out that, for any time-computable time complexity, the family of languages accepted by $$\text {SVIA}$$s is a characterization of the so-called complementation kernel of nondeterministic iterative array languages, that is, languages accepted by such devices whose complementation is also accepted by such devices. $$\text {SVIA}$$s can be sped-up by any constant multiplicative factor as long as the result does not fall below realtime. We show that even realtime $$\text {SVIA}$$ are as powerful as lineartime self-verifying cellular automata and vice versa. So they are strictly more powerful than the deterministic devices. Closure properties and various decidability problems are considered.
Fichier principal
Vignette du fichier
484947_1_En_6_Chapter.pdf (301.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Licence

Attribution

Identifiers

Cite

Martin Kutrib, Thomas Worsch. Iterative Arrays with Self-verifying Communication Cell. 25th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2019, Guadalajara, Mexico. pp.77-90, ⟨10.1007/978-3-030-20981-0_6⟩. ⟨hal-02312617⟩
33 View
14 Download

Altmetric

Share

Gmail Facebook X LinkedIn More