Abstract

Abstract. We show an interesting connection between two-way deterministic finite automata with monotonic counters and quadratic Diophantine equations. The automaton ¦ operates on inputs of the form We consider the following reachability problem: Given a machine ¦, a state, and a Presburger relation over counter values, is there such that ¦, when started in its initial state on the left end of the input with all counters initially zero, reaches some configuration where the state is and the counter values satisfy � ? In particular, we look at the case when the relation � is an equality relation, i.e., a conjunction of relations of the form. 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. � for some fixed � and distinct symbols § ¤� � ���� � � § � , where � ¤� � ���� � � � � are nonnegative integers.

Citations