Abstract
We study the problem of trimming visibly pushdown automata (VPA). We first describe a polynomial time procedure which, given a visibly pushdown automaton that accepts only well-nested words, returns an equivalent visibly pushdown automaton that is trimmed. We then show how this procedure can be lifted to the setting of arbitrary VPA. Furthermore, we present a way of building, given a VPA, an equivalent VPA which is both deterministic and trimmed.
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., Kumar, V., Madhusudan, P., Viswanathan, M.: Congruences for Visibly Pushdown Languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1102–1114. Springer, Heidelberg (2005)
Alur, R., Madhusudan, P.: Visibly Pushdown Languages. In: STOC, pp. 202–211 (2004)
Alur, R., Madhusudan, P.: Adding Nesting Structure to Words. JACM 56(3), 1–43 (2009)
von Braunmühl, B., Verbeek, R.: Input-driven Languages are Recognized in log n Space. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 40–51. Springer, Heidelberg (1983)
Buchsbaum, A.L., Giancarlo, R., Westbrook, J.: On the Determinization of Weighted Finite Automata. SIAM J. Comput. 30(5), 1502–1531 (2000)
Caralp, M., Reynier, P.-A., Talbot, J.-M.: Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 226–238. Springer, Heidelberg (2012)
Caralp, M., Reynier, P.-A., Talbot, J.-M.: A Polynomial Procedure for Trimming Visibly Pushdown Automata. Technical Report hal-00606778, HAL, CNRS, France (2013)
Choffrut, C.: Une Caractérisation des Fonctions Séquentielles et des Fonctions Sous-Séquentielles en tant que Relations Rationnelles. Theor. Comput. Sci. 5(3), 325–337 (1977)
De Souza, R.: Étude Structurelle des Transducteurs de Norme Bornée. PhD thesis, ENST, France (2008)
Driscoll, E., Thakur, A., Reps, T.: OpenNWA: A Nested-Word Automaton Library. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 665–671. Springer, Heidelberg (2012)
Filiot, E., Gauwin, O., Reynier, P.-A., Servais, F.: Streamability of Nested Word Transductions. In: FSTTCS. LIPIcs, vol. 13, pp. 312–324. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)
Girault-Beauquier, D.: Some Results About Finite and Infinite Behaviours of a Pushdown Automaton. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 187–195. Springer, Heidelberg (1984)
Mandel, A., Simon, I.: On Finite Semigroups of Matrices. Theor. Comput. Sci. 5(2), 101–111 (1977)
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
Caralp, M., Reynier, PA., Talbot, JM. (2013). Trimming Visibly Pushdown Automata. 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_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-39274-0_9
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)