Abstract

Abstract Probabilistic 1-way Turing machines are proved to be logarithmically more economical in the sense of space complexity for recognition of specific languages. Languages recognizable in o (loglog n) space are proved to be regular. One or two reversals of the head on the work tape of a probabilistic 1-way Turing machine can sometimes be simulated in no less than const n reversals by a deterministic machine.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call