A note on two-dimensional probabilistic finite automata
From MaRDI portal
Publication:1298347
DOI10.1016/S0020-0255(98)00008-5zbMath0936.68066OpenAlexW2013863551MaRDI QIDQ1298347
Katsushi Inoue, Akira Ito, Yue Wang, Lan Zhang, Tokio Okazaki
Publication date: 18 May 2000
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0255(98)00008-5
Related Items
Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic Turing machines, A note on two-dimensional probabilistic Turing machines, A Survey on Picture-Walking Automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound for probabilistic algorithms for finite state machines
- Multihead two-way probabilistic finite automata
- Two-dimensional alternative Turing machines
- On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes
- Non-negative matrices and Markov chains. 2nd ed
- A note on two-way probabilistic automata
- A note on two-dimensional finite automata
- Alternation
- Computational Complexity of Probabilistic Turing Machines
- Finite state verifiers I
- Probabilistic automata
- Picture languages with array rewriting rules
