A note on two-way probabilistic automata

Information Processing Letters

Volumn 43, Issue 6, 1992, Pages 321-326

  Wang, Jie ^a  

^a WILKES UNIVERSITY   (United States)

Author keywords

deterministic context sensitive languages; Formal languages; Markov chain; two way probabilistic finite state automata

Indexed keywords

CONTEXT FREE LANGUAGES; PROBABILITY;

PROBABILISTIC AUTOMATA; STOCHASTIC AUTOMATA; TWO-WAY PROBABILISTIC AUTOMATA;

FINITE AUTOMATA;

EID: 0026930141     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(92)90119-G     Document Type: Article

References (16)

1. Matrix tree theorems
2. Interactive proof systems with finite state verifiers
3. A time complexity gap for 2-way probabilistic finite state automata
4. Probabilistic two-way machines
5. A lower bound for probabilistic algorithms for finite state machines
6. Two-way probabilistic automata
7. Alternating pushdown and stack automata
8. The Markov chain tree theorem
9. Estimating a probability using finite memory
10. Memory bounds for recognition of context-free and context-sensitive languages
11. Probabilistic automata
12. On probabilistic automata and their generalizations