Abstract
We show an interesting connection between two-way deterministic finite automata with monotonic counters and quadratic Diophantine equations. The automaton M operates on inputs of the form a 1 i 1 ⋯ a n i n for some fixed n and distinct symbols a 1,…, a n , where i 1,…, i n are nonnegative integers. We consider the following reachability problem: given a machine M, a state q, and a Presburger relation E over counter values, is there ( i 1,…, i n ) such that M, when started in its initial state on the left end of the input a 1 i 1 ⋯ a n i n with all counters initially zero, reaches some configuration where the state is q and the counter values satisfy E? In particular, we look at the case when the relation E is an equality relation, i.e., a conjunction of relations of the form C i = C j . We show that this case and variations of it are equivalent to the solvability of some special classes of systems of quadratic Diophantine equations. We also study the nondeterministic version of two-way finite automata augmented with monotonic counters with respect to the reachability problem. Finally, we introduce a technique which uses decidability and undecidability results to show “separation” between language classes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.