论文信息 - Variations on the Technique of Duris and Galil

Variations on the Technique of Duris and Galil

Abstract The main result of this paper is that two-way nondeterministic counter automata are better than deterministic ones. Also the class of two-way deterministic counter automaton languages is compared with other classes of languages and some nonclosure properties of this class are proved.

Marek Chrobak

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

[2] Zvi Galil,et al. Fooling a two Way Automaton or one Pushdown Store is better than one Counter for two Way Machines , 1982, Theor. Comput. Sci..

[3] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[4] Burkhard Monien. Transformational methods and their application to complexity problems , 1976, Acta Informatica.

[5] Zvi Galil,et al. On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of their Pushdown Store , 1982, Inf. Control..

[6] Tat-hung Chan,et al. Reversal complexity of counter machines , 1981, STOC '81.

[7] Marek Chrobak. Nondeterminism Is Essential for Two-Way Counter Machines , 1984, MFCS.