Hierarchies and Undecidability Results for Iterative Arrays with Sparse 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 : 2018

Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication

Résumé

Iterative arrays with restricted internal inter-cell communication are investigated. A quantitative measure for the communication is defined by counting the number of uses of the links between cells and it is differentiated between the sum of all communications of an accepting computation and the maximum number of communications per cell occurring in accepting computations. The computational complexity of both classes of devices is investigated and put into relation. In addition, a strict hierarchy depending on the maximum number of communications per cell is established. Finally, it is shown that almost all commonly studied decidability questions are not semidecidable for iterative arrays with restricted communication and, moreover, it is not semidecidable as well whether a given iterative array belongs to a given class with restricted communication.
Fichier principal
Vignette du fichier
469010_1_En_8_Chapter.pdf (299.78 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01824868 , version 1 (27-06-2018)

Licence

Paternité

Identifiants

Citer

Andreas Malcher. Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication. 24th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2018, Ghent, Belgium. pp.100-112, ⟨10.1007/978-3-319-92675-9_8⟩. ⟨hal-01824868⟩
61 Consultations
45 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More