Insertion Operations on Deterministic Reversal-Bounded Counter Machines

  • Joey Eremondi
  • Oscar H. Ibarra
  • Ian McQuillanEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8977)


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.


Automata and logic Counter machines Insertion operations Reversal-bounds Determinism Finite automata 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences 8(3), 315–332 (1974)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Chiniforooshan, E., Daley, M., Ibarra, O.H., Kari, L., Seki, S.: One-reversal counter machines and multihead automata: Revisited. Theoretical Computer Science 454, 81–87 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Eremondi, J., Ibarra, O., McQuillan, I.: Insertion operations on deterministic reversal-bounded counter machines. Tech. Rep. 2014–01, University of Saskatchewan (2014).
  4. 4.
    Gurari, E.M., Ibarra, O.H.: The complexity of decision problems for finite-turn multicounter machines. Journal of Computer and System Sciences 22(2), 220–229 (1981)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Han, Y., Wood, D.: The generalization of generalized automata: Expression automata. International Journal of Foundations of Computer Science 16(03), 499–510 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Harrison, M.: Introduction to Formal Language Theory. Addison-Wesley Pub. Co., Addison-Wesley series in computer science (1978)Google Scholar
  7. 7.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)Google Scholar
  8. 8.
    Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM 25(1), 116–133 (1978)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Ibarra, O.H., Jiang, T., Tran, N., Wang, H.: New decidability results concerning two-way counter machines. SIAM J. Comput. 23(1), 123–137 (1995)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Jürgensen, H., Kari, L., Thierrin, G.: Morphisms preserving densities. International Journal of Computer Mathematics 78, 165–189 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Minsky, M.L.: Recursive unsolvability of Post’s problem of "tag" and other topics in theory of Turing Machines. Annals of Mathematics 74(3), 437–455 (1961)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Nicaud, C.: Average state complexity of operations on unary automata. In: Kutyłowski, M., Pacholski, L., Wierzbicki, T. (eds.) Mathematical Foundations of Computer Science 1999. Lecture Notes in Computer Science, vol. 1672, pp. 231–240. Springer, Berlin Heidelberg (1999)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Joey Eremondi
    • 1
  • Oscar H. Ibarra
    • 2
  • Ian McQuillan
    • 3
    Email author
  1. 1.Department of Information and Computing SciencesUtrecht UniversityUtrechtThe Netherlands
  2. 2.Department of Computer ScienceUniversity of CaliforniaSanta BarbaraUSA
  3. 3.Department of Computer ScienceUniversity of SaskatchewanSaskatoonCanada

Personalised recommendations