On possibilities of one-way synchronized and alternating automata
Synchronized alternating machines generalize alternating ones, similarly alternating machines generalize nondeterministic ones. We are interested in the following questions: 1) what is the simplest kind of device working over the single-letter alphabet for which synchronized alternation is more powerful than alternation, and 2) what are minimal conditions on automata making the emptiness problem unsolvable?
We prove that even in the case of 1-way finite automata with one head, synchronized alternating automata accept nonregular (nonsemilinear) languages over the single-letter alphabet. The main result of this paper is that the emptiness problem for languages accepted by arbitrary 1-way synchronized alternating automata with only one head is unsolvable — even over the single letter alphabet.
The emptiness problem for languages over the single-letter alphabet accepted by arbitrary 1-way finite alternating k-head automata is unsolvable for k>2.
There are many measures of complexity that can be reduced to one with arbitrarily small multiplicative constant. For the leafsize of accepting trees of 1-way finite alternating multitape automata this is not true.
KeywordsInternal State Finite Automaton Universal State Input Word Input Alphabet
Unable to display preview. Download preview PDF.
- [CKS81]A.K. Chandra, D.C. Kozen and L.E. Stockmeyer, Alternation, JACM 28 (1981), P. 114–133.Google Scholar
- [Fre81]R. Freivalds, Projections of Languages Recognizable By Probabilistic And Alternating Finite Multitape Automata, Information Processing Letters, v.13, 1981, p. 195–198.Google Scholar
- [Ge85]D. Geidmanis, On the Measure of Complexity for Alternating Finite Multitape Automata, In: Complexity Problems In Mathematical Logics, Kalinin State University Press, 1985, p.25–27. (Russian)Google Scholar
- [Ge88]D. Geidmanis, On the Capabilities of Alternating and Nondeterministic Multitape Automata, Proc. Found. of Comp. Theory, Lect. Notes in Comp. Sci., Springer, 1988, V.278.P.150–154.Google Scholar
- [Ge90]D. Geidmanis, Unsolvability of the Emptiness Problem for Alternating 1-way Multi-head and Multi-tape Finite Automata Over Single-letter Alphabet, to be published.Google Scholar
- [Gi66]S. Ginsburg, The Mathematical Theory of Context-Free Languages. McGraw Hill, 1966.Google Scholar
- [Hro84]J. Hromkovič, On the Power of Alternation in Finite Automata, MFCS, LNCS 176, P.322–329.Google Scholar
- [Iba78]Oscar H. Ibarra, Reversal bounded machines and their decision problems, JACM 25 (1978), P.116–133.Google Scholar
- [Ki81]K.N. King, Alternating multihead finite automata, Proc 8th ICALP, LNCS 115 (Springer, Berlin, 1981), P.506–520.Google Scholar
- [Ma70]Y. Matijasevich, Enumerable Sets Are Diophantine, Dokl. Akad. Nauk SSSR, 1970, 191, P.279–282 (in Russian). English translation in Soviet. Math. Dokl. 11, P.354–357.Google Scholar
- [MaRo75]Y. Matijasevic, J. Robinson, Reduction of an arbitrary diophantine equation to one in 13 unknowns, Acta Arithmetica, 1975, 27, P.521–553.Google Scholar
- [RaSc59]M.O.Rabin and D.Scott, Finite automata and their decision problems. IBM Journal of Research and Development, 3(1959).Google Scholar
- [Slo88]A. Slobodova, On the Power of Communication in Alternating Machines, MFCS, LNCS 324 (Springer, Berlin, 1988), P.518–526.Google Scholar