Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication
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.
Thanks are given to Victor Roussanaly for several discussions on the topic while his internship at our institute in 2014.
- 6.Kutrib, M.: Cellular automata - a computational point of view. In: Bel-Enguix, G., Jiménez-López, M.D., Martín-Vide, C. (eds.) New Developments in Formal Languages and Applications, Chap. 6. SCI, vol. 113, pp. 183–227. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78291-9_6CrossRefGoogle Scholar
- 13.Malcher, A.: On the descriptional complexity of iterative arrays. IEICE Trans. Inf. Syst. E87–D, 721–725 (2004)Google Scholar