Top

Published in:

2018 | OriginalPaper | Chapter

Input-Position-Restricted Models of Language Acceptors

Authors : Oscar H. Ibarra, Ian McQuillan

Published in: Reversibility and Universality

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

previous chapter An Overview of 2D Picture Array Generating Models Based on Membrane Computing

next chapter On the Persistency of Gellular Automata

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

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)

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

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

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)

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)MathSciNetCrossRefMATH

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

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

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)MathSciNetCrossRefMATH

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)MathSciNetCrossRefMATH

11.

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

12.

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

13.

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

14.

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

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)MathSciNetCrossRefMATH

17.

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

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)MathSciNetCrossRefMATH

Title: Input-Position-Restricted Models of Language Acceptors
Authors: Oscar H. Ibarra
Ian McQuillan
Publisher: Springer International Publishing
Book: Reversibility and Universality
Print ISBN: 978-3-319-73215-2

Electronic ISBN: 978-3-319-73216-9

Copyright Year: 2018
DOI: https://doi.org/10.1007/978-3-319-73216-9_17

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner