论文信息 - Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties

Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties

We introduce a model of one-way language acceptors (a variant of a checking stack automaton) and show the following decidability properties: 1. The deterministic version has a decidable membership problem but has an undecidable emptiness problem. 2. The nondeterministic version has an undecidable membership problem and emptiness problem.

Oscar H. Ibarra | Ian McQuillan

[1] Seymour Ginsburg,et al. Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

[2] Tao Jiang,et al. New Decidability Results Concerning Two-Way Counter Machines , 1995, SIAM J. Comput..

[3] 守屋悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[4] Tero Harju,et al. Some Decision Problems Concerning Semilinearity and Commutation , 2002, J. Comput. Syst. Sci..

[5] Eitan M. Gurari,et al. Two-Way Counter Machines and Diophantine Equations , 1982, JACM.

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

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

[8] Oscar H. Ibarra,et al. Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties , 2018, Theor. Comput. Sci..

[9] Sheila A. Greibach,et al. Checking Automata and One-Way Stack Languages , 1969, J. Comput. Syst. Sci..

[10] Joost Engelfriet. The Power to Two-Way Deterministic Checking Stack Automata , 1989, Inf. Comput..