Abstract
In this paper we consider two-way counter machines, i.e., two-way finite automata with counters whose contents have no effect on transitions except that an attempt to decrement an empty counter will abort the computation. We show that the deterministic machines have an unsolvable emptiness problem, but that their universe problem is solvable because they accept languages whose complements are context free. In the nondeterministic case, we show that these machines are equivalent to two-way nondeterministic logspace Turing machines, and establish an infinite hierarchy based on the number of weak counters. Finally, we disprove two conjectures concerning the nondeterministic machines.
Sign-in/Register to access full text options 
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.
