Probabilistic rebound Turing machines

DOI10.1016/S0304-3975(01)00098-6MaRDI QIDQ5958328zbMATH OpenFDO

Authors Lan Zhang, Katsushi Inoue, Akira Ito, Yue Wang

Publication date 3 March 2002

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

Full work available at URL https://doi.org/10.1016/S0304-3975(01)00098-6

zbMATH Keywords

closure propertyprobabilistic rebound Turing machinerebound automatonspace hierarchy

Mathematics Subject Classification ID

Recommendations

• A NOTE ON REBOUND TURING MACHINES
• scientific article; zbMATH DE number 1948497
• scientific article; zbMATH DE number 1916669
• A note on two-dimensional probabilistic Turing machines
• scientific article; zbMATH DE number 3887666

Cites work

• A lower bound for probabilistic algorithms for finite state machines
• A note on rebound automata
• A note on two-dimensional finite automata
• A note on two-way probabilistic automata
• Finite state verifiers I
• 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 1759445 (Why is no real title available?)
• scientific article; zbMATH DE number 1418343 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Lower space bounds for randomized computation
• Non-negative matrices and Markov chains. 2nd ed
• Probabilistic automata
• Remarks on the complexity of nondeterministic counter languages
• Some results concerning two-dimensional turing machines and finite automata

Cited in

(9)

• A note on two-dimensional probabilistic Turing machines
• scientific article; zbMATH DE number 3887666 (Why is no real title available?)
• scientific article; zbMATH DE number 3858415 (Why is no real title available?)
• scientific article; zbMATH DE number 3872684 (Why is no real title available?)
• Reactive Turing machines
• scientific article; zbMATH DE number 1948497 (Why is no real title available?)
• A NOTE ON REBOUND TURING MACHINES
• scientific article; zbMATH DE number 1916669 (Why is no real title available?)
• Probabilistic Turing machines and recursively enumerable Dedekind cuts

This page was built for publication: Probabilistic rebound Turing machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958328)