Abstract
For input-driven queue automata (\(\text {IDQA}\)) the input alphabet is divided into three distinct classes and the actions on the queue (enter, remove, nothing) are solely governed by the input symbols. Here, this model is extended in such a way that the input of an \(\text {IDQA}\) is preprocessed by an internal deterministic sequential transducer. These automata are called tinput-driven queue automata (\(\text {TDQA}\)). It turns out that even \(\text {TDQA}\)s with weak, that is, deterministic injective and length-preserving, internal transducers are more powerful than \(\text {IDQA}\)s. We study closure properties of the family of languages accepted by \(\text {TDQA}\)s. For example, for compatible signatures the closure under the Boolean operations union, intersection, and complementation is shown. For incompatible signatures and the operations reversal, concatenation, iteration, and length-preserving homomorphism non-closure results are obtained. Depending on the working mode of the transducer and the \(\text {IDQA}\), there are three nondeterministic working modes for tinput-driven queue automata. It is shown that for devices with nondeterministic transducers the nondeterministic \(\text {IDQA}\) can be determinized. The other classes form a strict hierarchy. Finally, several decidability problems are addressed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Babai, L. (ed.) Symposium on Theory of Computing (STOC 2004), pp. 202–211. ACM (2004)
Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56, 1–43 (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)
Book, R.V., Greibach, S.A., Wrathall, C.: Reset machines. J. Comput. Syst. Sci. 19, 256–276 (1979)
Brandenburg, F.: Multiple equality sets and Post machines. J. Comput. Syst. Sci. 21, 292–316 (1980)
von Braunmühl, B., Verbeek, R.: Input-driven languages are recognized in \(\log n\) space. In: Karpinski, M., van Leeuwen, J. (eds.) Topics in the Theory of Computation, Mathematics Studies, vol. 102, pp. 1–19. North-Holland, Amsterdam (1985)
Cherubini, A., Citrini, C., Crespi-Reghizzi, S., Mandrioli, D.: QRT FIFO automata, breadth-first grammars and their relations. Theoret. Comput. Sci. 85, 171–203 (1991)
Kutrib, M., Malcher, A., Mereghetti, C., Palano, B., Wendlandt, M.: Input-driven queue automata: Finite turns, decidability, and closure properties. Theoret. Comput. Sci. 578, 58–71 (2015)
La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: Logic in Computer Science (LICS 2007), pp. 161–170. IEEE Computer Society (2007)
Li, M., Longpré, L., Vitányi, P.M.B.: The power of the queue. SIAM J. Comput. 21, 697–712 (1992)
Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: Ball, T., Sagiv, M. (eds.) Principles of Programming Languages, (POpPL 2011), pp. 283–294. ACM (2011)
Mehlhorn, K.: Pebbling moutain ranges and its application of DCFL-recognition. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980, vol. 85, pp. 422–435. Springer, Heidelberg (1980)
Okhotin, A., Salomaa, K.: Complexity of input-driven pushdown automata. SIGACT News 45, 47–67 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Kutrib, M., Malcher, A., Wendlandt, M. (2016). Input-Driven Queue Automata with Internal Transductions. In: Dediu, AH., Janoušek, J., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2016. Lecture Notes in Computer Science(), vol 9618. Springer, Cham. https://doi.org/10.1007/978-3-319-30000-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-30000-9_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29999-0
Online ISBN: 978-3-319-30000-9
eBook Packages: Computer ScienceComputer Science (R0)