Regularity of one-letter languages acceptable by 2-way finite probabilistic automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 529 LNCS, Issue , 1991, Pages 287-296

  Kaņeps, Jānis ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

CUT-POINT; HIGH PROBABILITY; NON-REGULAR LANGUAGES; PROBABILISTIC AUTOMATA; PROBABILISTIC FINITE AUTOMATA;

C (PROGRAMMING LANGUAGE);

EID: 85032866146     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54458-5_73     Document Type: Conference Paper

References (15)

1. R.G.Bukharajcv. Fundamentals of the Theory of Probabilistic Automata.- Moscow. Nauka, 1985 (Russian).
2. C.Dwork and L.Stockmeyer. Interactive proof systems with finite state verifiers.- Report PJ 6262, IBM Research Division, San Jose, CA, 1988.
3. C.Dwork and L.Stockmeyer. On the power of 2-way probabilistic finite state automata.- Proc. 30th FOCS, 1989, p.480-485.
4. C.Dwork and L.Stockmeyer. A time complexity gap for two-way probabilistic finite state automata.-SIAM Journal of Computing, 1990, v.19, No.6, p.1011-1023.
5. R.Freivalds, Probabilistic two-way machines.- Lecture Notes in Computer Science, Springer, 1981, v.118, p33-45.
6. A.G.Greenberg and A.Weiss. A lower bound for probabilistic algorithms for finite state machines.-Journal of Computer and System Sciences, 1986, v33, p.88-105.
7. H.Jung. On probabilistic time and space.- Lecture Notes in Computer Science, Springer, 1985, v.194.
8. J.Kaņeps. Stochasticity of the languages recognizable by 2-way finite probabilistic automata.- Diskretnaya Matematika, 1989, v.1, n.4, p.63-74 (Russian).
9. J.Kaņeps and R.Freivalds. Running time to recognize nonregular languages by 2-way probabilistic automata.- Proc. ICALP’91, Springer, 1991.
10. Yu.I. Kuklin. Two-way probabilistic automata.- Avtomatika i vychislitelnaja tekhnika.- 1973, N5, p35-36 (Russian).
11. J.G.Kemeny and J.L.Snell. Finite Markov Chains.- Van Nostrand, Canada, 1960.
12. R.E.Ladner, R.J.Lipton, and L.J.Stockmeyer. Alternating pushdown and stack automata.- SIAM J.Comput, 1984, 13, No. 1, p.135-155.
13. F.T.Leighton and R.L.Rivest. The Markov Chain Tree Theorem.- MIT Laboratory for Computer Science TM-249, MIT, Cambridge, Mass, 1983.
14. M.O.Rabin.Probabilistic automata.- Information and Control.- 1963, v.6, n3.-p.230-245.
15. A.Salomaa and M.Soittola. Automata-theoretic Aspects of Formal Power Series.-Berlin: Springer, 1978.