Variations on the technique of Ďuriš and Galil

摘要

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.