Abstract
We introduce and study the model of input-driven queue automata. On such devices, the input letters uniquely determine the operations on the memory store which is organized as a queue. In particular, we consider the case where only a finite number of turns on the queue is allowed. The resulting language families share with regular languages many desirable properties. We show that emptiness and several other problems are decidable. Furthermore, we investigate closure under Boolean operations. The existence of an infinite and tight hierarchy depending on the number of turns is also proved.
Partially supported by CRUI/DAAD under the project “Programma Vigoni: Descriptional Complexity of Non-Classical Computational Models”, and MIUR under the project “PRIN: Automi e Linguaggi Formali: Aspetti Matematici e Applicativi”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC 2004, pp. 202–211. ACM (2004)
Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56 (2009)
Bensch, S., Holzer, M., Kutrib, M., Malcher, A.: Input-driven stack automata. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 28–42. Springer, Heidelberg (2012)
von Braunmühl, B., Verbeek, R.: Input-driven languages are recognized in logn space. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 40–51. Springer, Heidelberg (1983)
Cherubini, A., Citrini, C., Crespi-Reghizzi, S., Mandrioli, D.: qrt fifo automata, breadth-first grammars and their relations. Th. Comp. Sci. 85, 171–203 (1991)
Chomsky, N.: Formal properties of grammars. In: Handbook of Mathematical Psychology, vol. 2, pp. 323–418. Wiley, New York (1963)
Dymond, P.W.: Input-driven languages are in logn depth. Inform. Process. Lett. 26, 247–250 (1988)
Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM 14(2), 389–418 (1967)
Ginsburg, S., Spanier, E.H.: Finite-turn pushdown automata. SIAM J. Comput. 4(3), 429–453 (1966)
Greibach, S.A.: An infinite hierarchy of context-free languages. J. ACM 16, 91–106 (1969)
Holzer, M., Kutrib, M.: Flip-pushdown automata: k + 1 pushdown reversals are better than k. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 490–501. Springer, Heidelberg (2003)
Holzer, M., Kutrib, M.: Flip-pushdown automata: Nondeterminism is better than determinism. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 361–372. Springer, Heidelberg (2003)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: Principles of Programming Languages (POPL 2011), pp. 283–294. ACM (2011)
Malcher, M., Mereghetti, C., Palano, B.: Descriptional complexity of two-way pushdown automata with restricted head reversals. Th. Comp. Sci. 449, 119–133 (2012)
Mehlhorn, K.: Pebbling mountain ranges and its application of DCFL-recongnition. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 422–435. Springer, Heidelberg (1980)
Torre, S.L., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: Logic Comp. Sci. (LICS 2007), pp. 161–170. IEEE Comp. Soc. (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kutrib, M., Malcher, A., Mereghetti, C., Palano, B., Wendlandt, M. (2013). Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. In: Konstantinidis, S. (eds) Implementation and Application of Automata. CIAA 2013. Lecture Notes in Computer Science, vol 7982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39274-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-39274-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39273-3
Online ISBN: 978-3-642-39274-0
eBook Packages: Computer ScienceComputer Science (R0)