Skip to main content
SpringerLink
Log in

Input-Position-Restricted Models of Language Acceptors

  • Chapter
  • First Online:
Reversibility and Universality

Part of the book series: Emergence, Complexity and Computation ((ECC,volume 30))

  • 555 Accesses

Abstract

Machines of various types are studied with some restriction on the moves that can be made either on or before the end of the input. For example, for machine models such as deterministic reversal-bounded multicounter machines, one restriction is the class of all machines that do not subtract from any counters before the end the input. Similar restrictions are defined on different combinations of stores with many machine models (nondeterministic and deterministic), and their families studied.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Autebert, J.M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. Handbook of Formal Languages, vol. 1. Springer, Berlin (1997)

    Google Scholar 

  2. Bensch, S., Björklund, J., Kutrib, M.: Deterministic stack transducers. In: Han, Y.-S., Salomaa, K. (eds.) Implementation and Application of Automata: 21st International Conference, CIAA 2016, Seoul, South Korea, 19–22 July 2016, Proceedings. Lecture Notes in Computer Science, vol. 9705, pp. 27–38. Springer International Publishing, Berlin (2016)

    Google Scholar 

  3. Cadilhac, M., Finkel, A., McKenzie, P.: Bounded Parikh automata. Int. J. Found. Comput. Sci. 23(08), 1691–1709 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cadilhac, M., Finkel, A., McKenzie, P.: Affine Parikh automata. RAIRO - Theor. Inf. Appl. 46, 511–545 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chiniforooshan, E., Daley, M., Ibarra, O.H., Kari, L., Seki, S.: One-reversal counter machines and multihead automata: revisited. In: Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM’11, pp. 166–177. Springer, Berlin (2011)

    Google Scholar 

  6. Chiniforooshan, E., Daley, M., Ibarra, O.H., Kari, L., Seki, S.: One-reversal counter machines and multihead automata: revisited. Theor. Comput. Sci. 454, 81–87 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Eremondi, J., Ibarra, O.H., McQuillan, I.: Deletion operations on deterministic families of automata. Inf. Comput. TBA, 1–20 (2017)

    MathSciNet  MATH  Google Scholar 

  8. Ginsburg, S., Greibach, S.: Deterministic context free languages. Inf. Control 9(6), 620–648 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  9. Gurari, E.M., Ibarra, O.H.: The complexity of decision problems for finite-turn multicounter machines. J. Comput. Syst. Sci. 22(2), 220–229 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  10. Harju, T., Ibarra, O., Karhumki, J., Salomaa, A.: Some decision problems concerning semilinearity and commutation. J. Comput. Syst. Sci. 65(2), 278–294 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  12. Ibarra, O.H.: Visibly pushdown automata and transducers with counters. Fundam. Inform. 148(3–4), 291–308 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ibarra, O.H., McQuillan, I.: The effect of end-markers on counter machines and commutativity. Theor. Comput. Sci. 627, 71–81 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  14. Ibarra, O.H., McQuillan, I.: Applications of store languages to reachability (submitted, 2017)

    Google Scholar 

  15. Ibarra, O.H., McQuillan, I.: On store languages of language acceptors (submitted, 2017). https://arxiv.org/abs/1702.07388

  16. Ibarra, O.H., Yen, H.C.: On the containment and equivalence problems for two-way transducers. Theor. Comput. Sci. 429, 155–163 (2012)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  18. Ibarra, O.H., Seki, S.: Characterizations of bounded semilinear languages by one-way and two-way deterministic machines. Int. J. Found. Comput. Sci. 23(6), 1291–1306 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

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 Natural Sciences and Engineering Research Council of Canada Grant 2016-06172.

Author information

Authors and Affiliations

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

    Oscar H. Ibarra

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

    Ian McQuillan

Authors
  1. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ian McQuillan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Oscar H. Ibarra .

Editor information

Editors and Affiliations

  1. Unconventional Computing Centre, University of the West of England, Bristol, United Kingdom

    Andrew Adamatzky

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ibarra, O.H., McQuillan, I. (2018). Input-Position-Restricted Models of Language Acceptors. In: Adamatzky, A. (eds) Reversibility and Universality. Emergence, Complexity and Computation, vol 30. Springer, Cham. https://doi.org/10.1007/978-3-319-73216-9_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73216-9_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73215-2

  • Online ISBN: 978-3-319-73216-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation