Multihead two-way probabilistic finite automata

Theory of Computing Systems

Volumn 30, Issue 1, 1997, Pages 91-109

  Macarie, I I ^a,b  

^a STATE UNIVERSITY OF NEW YORK   (United States)

^b Millennium Computer Corporation   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; MACHINERY; TURING MACHINES;

COMPLETE PROBLEMS; DETERMINISTIC SIMULATION; PROBABILISTIC AUTOMATA; PROBABILISTIC COMPLEXITY; PROBABILISTIC FINITE AUTOMATA; SPACE EFFICIENT; TRANSITION MATRICES; TRANSITION PROBABILITIES;

FINITE AUTOMATA;

EID: 0031503673     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF02679455     Document Type: Article

References (44)

1. Borodin, A., Cook, S., and Pippenger, N. Parallel computation for well-endowed rings and space-bounded probabilistic machines. Information and Control, 48, 1983, pp. 113-136.
2. Dijkstra, E. W. Making a fair roulette from a possibly biased coin. Information Processing Letters, 36, 1990, pp. 193-193.
3. Dwork, C., and Stockmeyer, L. Finite state verifiers I: The power of interaction. Journal of the Association for Computing Machinery, 39, 1992, pp. 800-828.
4. Freivalds, R. Probabilistic two-way machines. Proceedings of the International Symposium on the Mathematical Foundations of Computer Science, 1981. Lecture Notes in Computer Science, 118, 1981, pp. 33-45.
5. Freivalds, R. Complexity of probabilistic versus deterministic automata. Baltic Computer Science, Selected Papers. Lecture Notes in Computer Science, 502, 1991, pp. 565-613.
6. Freivalds, R., and Karpinski, M. Lower space bounds for randomized computation. Proceedings of the 21st International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, 820, 1994, pp. 580-592.
7. Galil, Z. Two-way deterministic pushdown automata and some open problems in the theory of computation. Proceedings of the 15th Annual IEEE Symposium on Switching and Automata Theory, 1974, pp. 170-177.
8. Gill, J. Computational complexity of probabilistic Turing machines. SIAM Journal on Computing, 6, 1977, pp. 675-695.
9. Hartmanis, J. On non-determinancy in simple computing devices. Acta Informatica, 1, 1972, pp. 336-344.
10. Hartmanis, J., and Stearns, R. E. On the computational complexity of algorithms. Transactions of the American Mathematical Society, 117, 1965, pp. 285-306.
11. Hopcroft, J. E., and Ullman, J. D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 1979.
12. Ibarra, O. H. One two-way multihead automata. Journal of Computer and System Sciences, 7, 1973, pp. 28-36.
13. Immerman, N. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17, 1988, pp. 935-938.
14. Jones, N. D. Space-bounded reducibility among combinatorial problems. Journal of Computer and System Sciences, 11, 1975, pp. 68-75.
15. Jones, N. D., and Lien, Y. E. New problems complete for nondeterministic log space. Mathematical Systems Theory, 10, 1976, pp. 1-17.
16. Jung, H. Relationships between probabilistic and deterministic tape complexity. Proceedings of the International Symposium on the Mathematical Foundations of Computer Science, 1981. Lecture Notes in Computer Science, 118, 1981, pp. 339-346.
17. Jung, H. On probabilistic tape complexity and fast circuits for matrix inversion problems. Proceedings of the 11th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, 172, 1984, pp. 281-291.
18. Jung, H. On probabilistic time and space. Proceedings of the 12th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, 194, 1985, pp. 310-317.
19. Kaneps, J. Stochasticity of the languages recognizable by 2-way finite probabilistic automata. Diskretnaya Matematika, 1, no 4, 1989, pp. 63-77 (Russian).
20. Kaneps, J. Regularity of one-letter languages acceptable by 2-way finite probabilistic automata. Proceedings of the Fundamentals of Computation Theory, 1991. Lecture Notes in Computer Science, 529, 1991, pp. 287-296.
21. King, K. N. Alternating multihead finite automata. Theoretical Computer Science, 61, 1988, pp. 149-174.
22. Kuklin, Yu. I. Two-way probabilistic automata. Avtomatika i vycislitelnaja tekhnika, No. 5, 1973, pp. 35-36 (Russian).
23. Lewis II, P. M., Stearn, R., and Hartmanis, J. Memory bounds for recognition of context-free and context-sensitive languages. IEEE Conference Record on Switching Circuit Theory and Logical Design, 1965, pp. 191-202.
24. Macarie, I.I. Space-efficient deterministic simulations of probabilistic automata. Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, 775, 1994, pp. 109-122.
25. Macarie, I. I. Decreasing the bandwidth of a configuration matrix. Information Processing Letters, 53, no. 6, pp. 315-320.
26. Monien, B. Transformational methods and their application to complexity problems. Acta Informatica, 6, 1976, pp. 95-108.
27. Monien, B. Two-way multihead automata over a one-letter alphabet. R.A.I.R.O. Informatique Theoretique/Theoretical Informatics, 14, no. 1, 1980, pp. 67-82.
28. von Neumann, J. Various techniques used in connection with random digits. John von Neumann, Collected Works, Vol. V. Pergamon, Oxford, 1963, pp. 768-770.
29. Paz, A. Introduction to Probabilistic Automata. Academic Press, New York, 1971.
30. Ravikumar, B. Some observations on 2-way probabilistic finite automata. TR92-208, May 1992. Department of Computer Science and Statistics, University of Rhode Island.
31. Ruby, S. S., and Fischer, P. C. Translational methods and computational complexity. IEEE Conference Record on Switching Circuit Theory and Logical Design, 1965, pp. 173-178.
32. Ruzzo, W., Simon, J., and Tompa, M. Space-bounded hierarchies and probabilistic computation. Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982, pp. 215-223.
33. Santos, E. S. Probabilistic Turing machines and computability. Proceedings of the American Mathematical Society, 22, 1969, pp. 704-710.
34. Santos, E. S. Computability by probabilistic Turing machines. Transactions of the American Mathematical Society, 159, 1971, pp. 165-184.
35. Savitch, W. J. Relationships between nondeterministic and deterministic tape complexity. Journal of Computer and System Sciences, 4, 1970, pp. 177-192.
36. Seiferas, J. I. Relating refined space complexity classes. Journal of Computer and System Sciences, 14, 1977, pp. 100-129.
37. Seiferas, J. I. Techniques for separating space complexity classes. Journal of Computer and System Sciences, 14, 1977, pp. 73-99.
38. Simon, J. On the difference between one and many. Proceedings of the 4th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, 52, 1977, pp. 480-491.
39. Simon, J. Space-bounded probabilistic Turing machine complexity classes are closed under complement. Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981,pp. 158-167.
40. Sudborough, I. H. On tape-bounded complexity classes and multihead finite automata. Journal of Computer and System Sciences, 10, 1975, pp. 62-76.
41. Sudborough, I. H. On the tape complexity of deterministic context-free languages. Journal of the Association for Computing Machinery, 25, 1978, pp. 405-414.
42. Szelepcsenyi, R. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26, 1988, pp. 279-284.
43. Turakainen, P. On languages representable in rational probabilistic automata. Annales Academiae Scientiarum Fennicae, AI, 439.
44. Yao, A. C., and Rivest, R. L. K + 1 heads are better than K. Journal of the Association for Computing Machinery, 25, 1978, pp. 337-340.