Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Parallel Computing - Special issue on cellular automata: from modeling to applications
Fundamenta Informaticae - Special issue on cellular automata
Linear Time Language Recognition on Cellular Automata with Restricted Communication
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Descriptional complexity of cellular automata and decidability questions
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Real-time generation of primes by a 1-bit-communication cellular automaton
Fundamenta Informaticae - Special issue on cellular automata
Fast reversible language recognition using cellular automata
Information and Computation
Cellular automata and formal languages
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
New Developments in Formal Languages and Applications
New Developments in Formal Languages and Applications
Fast iterative arrays with restricted inter-cell communication: constructions and decidability
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
We investigate cellular automata whose internal inter-cell communication is bounded. The communication is quantitatively measured by the number of uses of the links between cells. It is shown that even the weakest non-trivial device in question, that is, one-way cellular automata where each two neighboring cells may communicate constantly often only, accept rather complicated languages. We investigate the computational capacity of the devices in question and prove an infinite strict hierarchy depending on the bound on the total number of communications during a computation. Despite their sparse communication even for the weakest devices, by reduction of Hilbert's tenth problem undecidability of several problems is derived. Finally, the question whether a given real-time one-way cellular automaton belongs to the weakest class is shown to be undecidable. This result can be adapted to answer an open question posed in [16].