Iterative Arrays with Small Time Bounds
An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fetches the input serially symbol by symbol. Sometimes in the literature this model is referred to as cellular automaton with sequential input mode. We investigate deterministic iterative arrays (IA) with small time bounds between real-time and linear-time. It is shown that there exists an infinite dense hierarchy of strictly included complexity classes in that range. The result closes the last gap in the time hierarchy of IAs.
KeywordsIterative arrays cellular automata computational complexity time hierarchies
Unable to display preview. Download preview PDF.
- 1.Beyer, W. T. Recognition of topological invariants by iterative arrays. Technical Report TR-66, MIT, Cambridge, Proj. MAC, 1969.Google Scholar
- 2.Buchholz, Th. and Kutrib, M. On the power of one-way bounded cellular time computers. Developments in Language Theory, 1997, pp. 365–375.Google Scholar
- 5.Buchholz, Th., Klein, A., and Kutrib, M. Deterministic turing machines in the range between real-time and linear-time. To appear.Google Scholar
- 9.Fischer, P. C. Generation of primes by a one-dimensional real-time iterative array. J. Assoc. Comput. Mach. 12 (1965), 388–394.Google Scholar
- 19.Wagner, K. and Wechsung, G. Computational Complexity. Reidel Publishing, Dordrecht, 1986.Google Scholar