Abstract
We show that the hierarchy of classes of languages accepted by finite multi-head automata with oblivious head movements that receive polynomial advice strings collapses to the fifth level. A characterization of nondeterministic logarithmic space with polynomial advice is simplified. In the presence of polynomial advice, the question whether deterministic and nondeterministic logarithmic space are equivalent can be reduced to the question whether simple nondeterministic automata can be simulated deterministically. Polynomial time can be characterized by a one-head device.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
