Insertion Operations on Deterministic Reversal-Bounded Counter Machines
Several insertion operations are studied applied to languages accepted by one-way and two-way deterministic reversal-bounded multicounter machines. These operations are defined by the ideals obtained from relations such as the prefix, infix, suffix and outfix relations. The insertion of regular languages and other languages into deterministic reversal-bounded multicounter languages is also studied. The question of whether the resulting languages can always be accepted by deterministic machines with the same number of turns on the input tape, the same number of counters, and reversals on the counters is investigated. In addition, the question of whether they can always be accepted by increasing either the number of input tape turns, counters, or counter reversals is addressed. The results in this paper form a complete characterization based on these parameters. Towards these new results, we use a technique for simultaneously showing a language cannot be accepted by both one-way deterministic reversal-bounded multicounter machines, and by two-way deterministic machines with one reversal-bounded counter.
KeywordsAutomata and logic Counter machines Insertion operations Reversal-bounds Determinism Finite automata
Unable to display preview. Download preview PDF.
- 3.Eremondi, J., Ibarra, O., McQuillan, I.: Insertion operations on deterministic reversal-bounded counter machines. Tech. Rep. 2014–01, University of Saskatchewan (2014). http://www.cs.usask.ca/documents/techreports/2014/TR-2014-01.pdf
- 6.Harrison, M.: Introduction to Formal Language Theory. Addison-Wesley Pub. Co., Addison-Wesley series in computer science (1978)Google Scholar
- 7.Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)Google Scholar