Abstract
A d-dimensional cellular automaton with sequential input mode is a d-dimensional grid of interconnected interacting finite automata. The distinguished automaton at the origin, the communication cell, is connected to the outside world and fetches the input sequentially. Often in the literature this model is referred to as iterative array. We investigate d-dimensional iterative arrays and one-dimensional cellular automata operating in real and linear time, whose inter-cell communication is restricted to some constant number of bits independent of the number of states. It is known that even one-dimensional one-bit iterative arrays accept rather complicated languages such as a p |p prim or a 2n|n∈ℕ [16]. We show that there is an infinite strict double dimension-bit hierarchy. The computational capacity of the one-dimensional devices in question is compared with the power of communication-restricted two-way cellular automata. It turns out that the relations are quite different from the relations in the unrestricted case. On passing, we obtain an infinite strict bit hierarchy for real-time two-way cellular automata and, moreover, a very dense time hierarchy for every k-bit cellular automata, i.e., just one more time step leads to a proper superfamily of accepted languages.
Please use the following format when citing this chapter: Kutrib, M., Malcher, A., 2006, in International Federation for Information Processing, Volume 209, Fourth IFIP International Conference on Theoretical Computer Science-TCS 2006, eds. Navarro, G., Bertossi, L., Kohayakwa, Y., (Boston: Springer), pp. 151–164.
Chapter PDF
Similar content being viewed by others
Key words
References
Buchholz T, Klein A, Kutrib M (1999) Iterative arrays with a wee bit alternation. In: Fundamentals of Computation Theory 1999, LNCS 1684, pp 173–184
Buchholz T, Klein A, Kutrib M (2000) Iterative arrays with small time bounds. In: Mathematical Foundations of Computer Science 1998, LNCS 1893, pp 243–252
Buchholz T, Klein A, Kutrib M (1999) Iterative arrays with limited nondeterministic communication cell. In: Words, Languages and Combinatorics III, pp 73–87
Chang JH, Ibarra OH, Palls MA (1987) Parallel parsing on a one-way array of finite-state machines. IEEE Trans Comput C-36:64–75
Cole SN (1969) Real-time computation by n-dimensional iterative arrays of finitestate machines. IEEE Trans Comput C-18:349–365
Fischer PC (1965) Generation of primes by a one-dimensional real-time iterative array. J ACM 12:388–394
Ibarra OH, Palls MA (1985) Some results concerning linear iterative (systolic) arrays. J Parallel Distributed Comput 2:182–218
Ibarra OH, Palls MA (1988) Two-dimensional iterative arrays: Characterizations and applications. Theoret Comput Sci 57:47–86
Iwamoto C, Hatsuyama T, Morita K, Imai K (1999) On time-constructibIe functions in one-dimensional cellular automata. In: Fundamentals of Computation Theory 1999, LNCS 1684, pp 317–326
Malcher A (2004) On the descriptional complexity of iterative arrays. IEICE Transactions on Information and Systems E87-D:721–725
Seidel SR (1979) Language recognition and the synchronization of cellular automata Technical Report 79-02, Department of Computer Science, University of Iowa, Iowa City
Smith IIIAR (1972) Real-time language recognition by one-dimensional cellular automata. J Comput System Sci 6:233–253
Terrier V (1995) On real time one-way cellular array. Theoret Comput Sci 141:331–335
Umeo H (2001) Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton. Parallel Comput 27:587–599
Umeo H, Kamikawa N (2002) A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications. Fund Inform 52:257–275
Umeo H, Kamikawa N (2003) Real-time generation of primes by a 1-bit-communication cellular automaton. Fund Inform 58:421–435
Worsch T (2000) Linear time language recognition on cellular automata with restricted communication. In: Latin 2000: Theoretical Informatics, LNCS 1776, pp 417–426
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Kutrib, M., Malcher, A. (2006). Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds) Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006. IFIP International Federation for Information Processing, vol 209. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34735-6_15
Download citation
DOI: https://doi.org/10.1007/978-0-387-34735-6_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34633-5
Online ISBN: 978-0-387-34735-6
eBook Packages: Computer ScienceComputer Science (R0)