A note on two-dimensional probabilistic Turing machines
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1948497
- A note on one-pebble two-dimensional Turing machines
- Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic Turing machines
- A note on one-pebble two-dimensional Turing machines
- Probabilistic rebound Turing machines
Cites work
- scientific article; zbMATH DE number 3738961 (Why is no real title available?)
- scientific article; zbMATH DE number 3765145 (Why is no real title available?)
- scientific article; zbMATH DE number 1346510 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A hierarchy result for 2-dimensional TM's operating in small space
- A lower bound for probabilistic algorithms for finite state machines
- A note on two-dimensional finite automata
- A note on two-dimensional probabilistic finite automata
- A note on two-way probabilistic automata
- Alternation
- Computational Complexity of Probabilistic Turing Machines
- Finite state verifiers I
- Multihead two-way probabilistic finite automata
- Non-negative matrices and Markov chains. 2nd ed
- On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes
- Picture languages with array rewriting rules
- Probabilistic automata
- Turing machines with sublogarithmic space
- Two-dimensional alternative Turing machines
Cited in
(2)
This page was built for publication: A note on two-dimensional probabilistic Turing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818955)
