A note on probabilistic rebound automata

IEICE Transactions on Information and Systems

Volumn E81-D, Issue 10, 1998, Pages 1045-1052

  Zhang, Lan ^a,b   Okazaki, Tokio ^a   Inoue, Katsushi ^a   Itq, Akira ^a   Wang, Vue ^a  

^a YAMAGUCHI UNIVERSITY   (Japan)

^b TOKYO UNIVERSITY OF SCIENCE   (Japan)

Author keywords

Closure property; Context free language; One marker rebound automaton; Probabilistic rebound automaton; Two way nondeterministic one counter automaton

Indexed keywords

CONTEXT FREE LANGUAGES; PROBABILISTIC LOGICS;

PROBABILISTIC REBOUND AUTOMATA;

AUTOMATA THEORY;

EID: 0032182279     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. M. Blum and C. Hewitt, "Automata on a two-dimensional tape," IEEE Symp. on Switching and Automata Theory, pp. 155-160, 1967.
2. M. Chrobak, "Variations on the Technique of Ďuris̄ and Galil," J. Comput. Sys. Sci., vol.30, pp.77-85, 1985.
3. C. Dwork and L. Stockmeyer, "Finite state verifiers I: The power of interaction," J. ACM 39, 4, pp.800-828, 1992.
4. R. Freivalds, "Probabilistic two-way machines," Proc. international Symposium on Mathematical Foundations of Computer science. Lecture Notes in Compute Science, vol.118, pp.33-45, Springer-Verlag, New York, 1981.
5. J. Gill, "Computational Complexity of Probabilistic Turing Machines," SIAM J. COMPUT., vol.6, no.4, pp.675-695, 1977.
6. A.G. Greenberg and A. Weiss, "A lower bound for probabilistic algorithms for finite state machines," J. Comput. Syst. Sci., vol.33, pp.88-105, 1986.
7. S.A. Greibach, "Remarks on the complexity of nondeterministic counter languages," Theoretical Computer Science, vol.1, pp.269-288, 1976.
8. J.D. Hopcroft and J.D. Ullman, "Formal Languages and Their Relation to Automata," Addison-Wesley, Reading, Mass, 1969.
9. K. Inoue, I. Takanami, and A. Nakamura, "A note on two-dimensional finite automata," Information Processing Letters, vol.7, no.l, pp.49-52, 1978.
10. K. Inoue, I. Takanami, and H. Taniguchi, "A note on rebound automata," Information Sciences, vol.26, pp.87-93, 1982.
11. J. Kaneps, "Regularity of one-letter languages acceptable by 2-way finite probabilistic automata," Proc. Foundamental of Computation Theory. Lecture Notes in Compute Science, vol.529, pp.287-296, 1991.
12. M. Karpinski and R. Verbeek, "On the monte carlo space constructible functions and separation results for probabilistic complexity classes," Information and Computation 75, pp.178-189, 1987.
13. I.I. Macarie, "Multihead two-way probabilistic finite automata," Theoretical Computer Science, vol.30, pp.91-109, 1997.
14. M.O. Rabin, "Probabilistic automata," Inf. Contr., vol.6, pp.230-245, 1963.
15. A. Rosenfeld, "Picture Languages (Formal Models for Picture Recognition)," Academic Press, New York, 1979.
16. M. Sakamoto, K. Inoue, and I. Takanami, "A two-way nondeterministic one-counter language not accepted by nondeterministic rebound automata," IEICE Trans., vol.E-73, no.6, pp.879-881, 1990.
17. E. Seneta, "Non-Negative Matrices and Markov Chains," 2nd Ed. Springer-Verlag, New York, 1981.
18. K. Sugata, H. Umeo, and K. Morita, "On the computing abilities of rebound automata," IECE Trans., pp.367-374, 1977.
19. J. Wang, "A note on two-way probabilistic automata," Information Processing Letters, vol.43, pp.321-326, 1992.