Probabilistic rebound Turing machines

DOI10.1016/S0304-3975(01)00098-6zbMath0988.68072MaRDI QIDQ5958328

Akira Ito, Yue Wang, Lan Zhang, Katsushi Inoue

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

closure propertyprobabilistic rebound Turing machinerebound automatonspace hierarchy

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound for probabilistic algorithms for finite state machines
• Non-negative matrices and Markov chains. 2nd ed
• A note on rebound automata
• A note on two-way probabilistic automata
• Remarks on the complexity of nondeterministic counter languages
• A note on two-dimensional finite automata
• Finite state verifiers I
• Lower space bounds for randomized computation
• Some results concerning two-dimensional turing machines and finite automata
• Probabilistic automata

This page was built for publication: Probabilistic rebound Turing machines