Abstract
Motivated by preprocessing devices occurring for example in the context of syntactic parsers or HTML sanitization, we study pairs of finite state transducers and deterministic machines such as pushdown automata or queue automata as language accepting devices, where the original input is translated by a finite state transducer to an input of the deterministic machine which eventually accepts or rejects the preprocessed input. As deterministic machines we study input-driven machines as well as reversible machines equipped with a pushdown store or a queue store. It turns out that the preprocessing boosts on the one hand the computational power of the machines in all four cases, but on the other hand preserves and adds some positive closure properties as well as decidable problems. Thus, the preprocessing extends the computational power moderately by retaining most of the nice properties of the original machine.
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 subscriptionsReferences
Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling. Vol. I: Parsing. Prentice-Hall Inc., Englewood Cliffs (1972)
Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Babai, L. (ed.) Symposium on Theory of Computing (STOC 2004), pp. 202–211. ACM (2004)
Axelsen, H.B., Kutrib, M., Malcher, A., Wendlandt, M.: Boosting reversible pushdown machines by preprocessing. In: Devitt, S., Lanese, I. (eds.) RC 2016. LNCS, vol. 9720, pp. 89–104. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40578-0_6
Axelsen, H.B., Kutrib, M., Malcher, A., Wendlandt, M.: Boosting reversible pushdown and queue machines by preprocessing (2018, Submitted to a journal)
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. Theor. Comput. Sci. 85, 171–203 (1991)
Citrini, C., Crespi-Reghizzi, S., Mandrioli, D.: On deterministic multi-pass analysis. SIAM J. Comput. 15(3), 668–693 (1986)
Friburger, N., Maurel, D.: Finite-state transducer cascades to extract named entities in texts. Theor. Comput. Sci. 313(1), 93–104 (2004)
Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)
Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. Syst. Sci. 78(6), 1814–1827 (2012)
Kutrib, M., Malcher, A., Mereghetti, C., Palano, B., Wendlandt, M.: Deterministic input-driven queue automata: finite turns, decidability, and closure properties. Theor. Comput. Sci. 578, 58–71 (2015)
Kutrib, M., Malcher, A., Wendlandt, M.: Input-driven queue automata with internal transductions. In: Dediu, A.-H., Janoušek, J., Martín-Vide, C., Truthe, B. (eds.) LATA 2016. LNCS, vol. 9618, pp. 156–167. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-30000-9_12
Kutrib, M., Malcher, A., Wendlandt, M.: Reversible queue automata. Fundam. Inform. 148(3–4), 341–368 (2016)
Kutrib, M., Malcher, A., Wendlandt, M.: Tinput-driven pushdown, counter, and stack automata. Fundam. Inform. 155(1–2), 59–88 (2017)
Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183–191 (1961)
Mehlhorn, K.: Pebbling mountain ranges and its application to DCFL-recognition. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 422–435. Springer, Heidelberg (1980). https://doi.org/10.1007/3-540-10003-2_89
Okhotin, A., Salomaa, K.: Complexity of input-driven pushdown automata. SIGACT News 45(2), 47–67 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Kutrib, M., Malcher, A., Wendlandt, M. (2018). Boosting Pushdown and Queue Machines by Preprocessing. In: Câmpeanu, C. (eds) Implementation and Application of Automata. CIAA 2018. Lecture Notes in Computer Science(), vol 10977. Springer, Cham. https://doi.org/10.1007/978-3-319-94812-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-94812-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94811-9
Online ISBN: 978-3-319-94812-6
eBook Packages: Computer ScienceComputer Science (R0)