论文信息 - Simple Counter Machines and Number-Theoretic Problems

Simple Counter Machines and Number-Theoretic Problems

Abstract The class of deterministic two-way finite automata augmented by reversal-bounded counters operating on inputs over a one-letter alphabet is studied. It is shown that every machine in this class can effectively be reduced to an equivalent (ordinary) finite automaton. Thus, all questions about finite automata that are decidable are also decidable when asked about machines in this class. Applications to some number-theoretic problems are given.

Eitan M. Gurari | Oscar H. Ibarra | O. Ibarra | E. Gurari

[1] Oscar H. Ibarra,et al. Finite Automata with Multiplication , 1976, Theor. Comput. Sci..

[2] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[3] Peter Weiner,et al. A Characterization of Semilinear Sets , 1970, J. Comput. Syst. Sci..

[4] Brenda S. Baker,et al. Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[5] Jan van Leeuwen. A partial solution to the reachability-problem for vector-addition systems , 1974, STOC '74.

[6] Oscar H. Ibarra,et al. Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[7] Eitan M. Gurari,et al. An NP-Complete Number-Theoretic Problem , 1979, JACM.

[8] M. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .