Skip to main content
SpringerLink
Log in

Insertion Operations on Deterministic Reversal-Bounded Counter Machines

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8977))

Abstract

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.

The research of O. H. Ibarra was supported, in part, by NSF Grant CCF-1117708. The research of I. McQuillan was supported, in part, by the Natural Sciences and Engineering Research Council of Canada.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences 8(3), 315–332 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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

  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)

    Article  MATH  MathSciNet  Google Scholar 

  5. Han, Y., Wood, D.: The generalization of generalized automata: Expression automata. International Journal of Foundations of Computer Science 16(03), 499–510 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  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 

  8. Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM 25(1), 116–133 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  10. Jürgensen, H., Kari, L., Thierrin, G.: Morphisms preserving densities. International Journal of Computer Mathematics 78, 165–189 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Computing Sciences, Utrecht University, 80.089 3508, TB, Utrecht, The Netherlands

    Joey Eremondi

  2. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

  3. Department of Computer Science, University of Saskatchewan, Saskatoon, SK, S7N 5A9, Canada

    Ian McQuillan

Authors
  1. Joey Eremondi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ian McQuillan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ian McQuillan .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu

  2. Nice Sophia Antipolis University, Sophia Antipolis, France

    Enrico Formenti

  3. Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  4. Justus-Liebig-Universität, Gießen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Eremondi, J., Ibarra, O.H., McQuillan, I. (2015). Insertion Operations on Deterministic Reversal-Bounded Counter Machines. In: Dediu, AH., Formenti, E., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science(), vol 8977. Springer, Cham. https://doi.org/10.1007/978-3-319-15579-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15579-1_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15578-4

  • Online ISBN: 978-3-319-15579-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation