# 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.
Document type :
Conference papers
Domain :

Cited literature [14 references]

https://hal.inria.fr/hal-02312617
Contributor : Hal Ifip <>
Submitted on : Friday, October 11, 2019 - 11:34:02 AM
Last modification on : Friday, October 11, 2019 - 11:39:23 AM

### File

##### Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2022-01-01

### Citation

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⟩

Record views