Abstract
We establish a tight hierarchy of two-way synchronized finite automata having only universal states on the number of allowed processes, i.e. L(2SUFA(kproc)) \(\subsetneq\) L(2SUFA(k + 1-proc)), by studying reduction functions made by two-way deterministic finite automata with a one-way write-only output tape. Consequently for every k > 1, L(2SUFA(k-proc)) has a complete set under 2DFA reductions and is not closed under union or intersection. In contrast, we show that the corresponding hierarchy collapses for unary alphabets. Next we study multihead synchronized finite automata having only universal states. We show that ∪ ∞k=1 L(2SUFA(k-heads)) = ∪ ∞k=1 L(2UFA(k-heads)) = NLOG, and ∪ ∞k=1 L(1SUFA(k- heads)) = ∪ ∞k=1 L(1UFA(k-heads)). As a result, we establish a tight hierarchy on the number of heads of the two-way machines, i.e. L(2SUFA(k-heads)) \(\subsetneq\) L(2SUFA(k+l-heads)), and a weaker hierarchy of the one-way machines, i.e. L(1SUFA(k-heads)) \(\subsetneq\) L(1SUFA(2k + 1heads)).
Finally, we show that any reasonable class of synchronized pushdown or counter machines accepts all r.e. languages.
Preview
Unable to display preview. Download preview PDF.
References
A. K. Chandra, D. K. Kozen, and J. Stockmeyer, Alternation, J. ACM, 28 (1981), pp. 114–133.
J. Dassow, J. Hromkovic, J. Karhumäki, B. Rovan, and A. Slobodová, On the power of synchronization in parallel computations, in Proc. 14th MFCS'89, Lecture Notes in Computer Science 379, Springer-Verlag, 1989, pp. 196–206.
M. A. Harrison and O. H. Ibarra, Multi-tape and multi-head pushdown automata, Information and Control, 13 (1968), pp. 433–470.
J. Hromkovič, J. Karhumäki, B. Rovan, and A. Slobodová, On the power of synchronization in parallel computations, tech. report, Comenius University, Bratislava, Czechoslovakia, Department of Theoretical Cybernetics and Institute of Computer Science, 1989.
J. Hromkovič, How to organize the communication among parallel processes in alternating computations. Manuscript, January 1986.
J. Hromkovič, B. Rovan, and A. Slobodová, Deterministic versus nondeterministic space in terms of synchronized alternating machines, tech. report, Comenius University, Bratislava, Czechoslovakia, Department of Theoretical Cybernetics and Institute of Computer Science, 1989.
J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979.
O. Ibarra, On two-way multihead automata, Journal of Computer and System Sciences, 7 (1973), pp. 28–36.
O. H. Iarra and N. Q. Tran, On space-bounded synchronized alternating Turing machines. To appear in Theoretical Computer Science, 1990.
B. Monien, Two-way multihead automata over a one-letter alphabet, RAIRO Inform. Theor., 14 (1980), pp. 67–82.
A. Slobodová, On the power of communication in alternating computations. Student Research Papers Competition, Section Computer Science (in Slovac), Comenius University, Bratislava, Czechoslovakia, April 1987.
-, On the power of communication in alternating machines, in Proc. 13th MFCS'88, Lecture Notes in Computer Science 324, Springer-Verlag, 1988, pp. 518–528.
-, Some properties of space-bounded synchronized alternating Turing machines with only universal states, in Proc. 5th IMYCS'88, Lecture Notes in Computer Science 381, Springer-Verlag, 1988, pp. 102–113.
S. Sakurayama, H. Matsuno, K. Inoue, I. Takanami, and H. Taniguchi, Alternating one-way multihead Turing machines with only universal states, Trans. IECE Japan E, 68 (1985), pp. 705–711.
J. Wiedermann, On the power of synchronization, tech. report, VUSEIAR, Bratislava, Czechoslovakia, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ibarra, O.H., Trân, N.Q. (1992). New results concerning synchronized finite automata. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_69
Download citation
DOI: https://doi.org/10.1007/3-540-55719-9_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55719-7
Online ISBN: 978-3-540-47278-0
eBook Packages: Springer Book Archive