Iterative Arrays with Finite Inter-cell Communication - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Iterative Arrays with Finite Inter-cell Communication

Résumé

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.
Fichier principal
Vignette du fichier
484947_1_En_3_Chapter.pdf (312.18 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Licence

Paternité

Identifiants

Citer

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⟩
24 Consultations
19 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More