Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties

  • Martin Kutrib
  • Andreas Malcher
  • Carlo Mereghetti
  • Beatrice Palano
  • Matthias Wendlandt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7982)


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.


Input-driven automata queue automata finite turns decidability questions closure properties 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC 2004, pp. 202–211. ACM (2004)Google Scholar
  2. 2.
    Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56 (2009)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Chomsky, N.: Formal properties of grammars. In: Handbook of Mathematical Psychology, vol. 2, pp. 323–418. Wiley, New York (1963)Google Scholar
  7. 7.
    Dymond, P.W.: Input-driven languages are in logn depth. Inform. Process. Lett. 26, 247–250 (1988)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM 14(2), 389–418 (1967)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Ginsburg, S., Spanier, E.H.: Finite-turn pushdown automata. SIAM J. Comput. 4(3), 429–453 (1966)MathSciNetzbMATHGoogle Scholar
  10. 10.
    Greibach, S.A.: An infinite hierarchy of context-free languages. J. ACM 16, 91–106 (1969)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    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)CrossRefGoogle Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)zbMATHGoogle Scholar
  14. 14.
    Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: Principles of Programming Languages (POPL 2011), pp. 283–294. ACM (2011)Google Scholar
  15. 15.
    Malcher, M., Mereghetti, C., Palano, B.: Descriptional complexity of two-way pushdown automata with restricted head reversals. Th. Comp. Sci. 449, 119–133 (2012)MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    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)CrossRefGoogle Scholar
  17. 17.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Martin Kutrib
    • 1
  • Andreas Malcher
    • 1
  • Carlo Mereghetti
    • 2
  • Beatrice Palano
    • 2
  • Matthias Wendlandt
    • 1
  1. 1.Institut für InformatikUniversität GiessenGiessenGermany
  2. 2.Dip. InformaticaUniv. degli Studi di MilanoMilanoItaly

Personalised recommendations