Abstract
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. We are investigating iterative arrays with an alternating communication cell. All the other automata are deterministic. The number of alternating state transitions is regarded as a limited resource which depends on the length of the input.
We center our attention to real-time computations and compare alternating IAs with nondeterministic IAs. By proving that the language families of the latter are not closed under complement for sublogarithmic limits it is shown that alternation is strictly more powerful than nondeterminism. Moreover, for these limits there exist infinite hierarchies of properly included alternating language families. It is shown that these families are closed under boolean operations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beyer, W. T. Recognition of topological invariants by iterative arrays. Technical Report TR-66, MIT, Cambridge, Proj. MAC, 1969.
Buchholz, Th. and Kutrib, M. Some relations between massively parallel arrays. Parallel Comput. 23 (1997), 1643–1662.
Buchholz, Th., Klein, A., and Kutrib, M. Iterative arrays with a wee bit alternation. IFIG Report 9905, Institute of Informatics, University of Giessen, 1999.
Buchholz, Th., Klein, A., and Kutrib, M. Iterative arrays with limited nondeterministic communication cell. IFIG Report 9901, Institute of Informatics, University of Giessen, 1999.
Chang, J. H., Ibarra, O. H., and Palis, M. A. Parallel parsing on a one-way array of finite-state machines. IEEE Trans. Comput. C-36 (1987), 64–75.
Cole, S. N. Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Trans. Comput. C-18 (1969), 349–365.
Čulik II, K. and Yu, S. Iterative tree automata. Theoret. Comput. Sci. 32 (1984), 227–247.
Fischer, P. C. Generation of primes by a one-dimensional real-time iterative array. J. Assoc. Comput. Mach. 12 (1965), 388–394.
Ibarra, O. H. and Jiang, T. On one-way cellular arrays. SIAM J. Comput. 16 (1987), 1135–1154.
Ibarra, O. H. and Palis, M. A. Some results concerning linear iterative (systolic) arrays. J. Parallel and Distributed Comput. 2 (1985), 182–218.
Ibarra, O. H. and Palis, M. A. Two-dimensional iterative arrays: Characterizations and applications. Theoret. Comput. Sci. 57 (1988), 47–86.
Seiferas, J. I. Iterative arrays with direct central control. Acta Inf. 8 (1977), 177–192.
Seiferas, J. I. Linear-time computation by nondeterministic multidimensional iterative arrays. SIAM J. Comput. 6 (1977), 487–504.
Smith III, A. R. Real-time language recognition by one-dimensional cellular automata. J. Comput. System Sci. 6 (1972), 233–253.
Terrier, V. On real time one-way cellular array. Theoret. Comput. Sci. 141 (1995), 331–335.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buchholz, T., Klein, A., Kutrib, M. (1999). Iterative arrays with a wee bit alternation. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_13
Download citation
DOI: https://doi.org/10.1007/3-540-48321-7_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66412-3
Online ISBN: 978-3-540-48321-2
eBook Packages: Springer Book Archive