Skip to Main content Skip to Navigation
Conference papers

Iterative Arrays with Finite Inter-cell Communication

Abstract : Iterative arrays whose internal inter-cell communication is quantitatively restricted are investigated. The quantity of communication is measured by counting the number of uses of the links between cells. In particular, iterative arrays are studied where the maximum number of communications per cell occurring in accepting computations is drastically bounded by a constant number. Additionally, the iterative arrays have to work in realtime. We study the computational capacity of such devices. One main result is that a strict and dense hierarchy with respect to the constant number of communications exists. Due to their very restricted communication, the question arises whether the usually studied decidability problems such as, for example, emptiness, finiteness, inclusion, or equivalence become decidable for such devices. However, by reduction of Hilbert’s tenth problem it can be shown that all such decidability questions remain undecidable.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Friday, October 11, 2019 - 11:33:15 AM
Last modification on : Friday, October 11, 2019 - 11:39:24 AM


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

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



Martin Kutrib, Andreas Malcher. Iterative Arrays with Finite Inter-cell Communication. 25th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2019, Guadalajara, Mexico. pp.35-47, ⟨10.1007/978-3-030-20981-0_3⟩. ⟨hal-02312607⟩



Record views