Advertisement

Visibly Pushdown Transducers with Look-Ahead

  • Emmanuel Filiot
  • Frédéric Servais
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7147)

Abstract

Visibly Pushdown Transducers (VPT) form a subclass of pushdown transducers. In this paper, we investigate the extension of VPT with visibly pushdown look-ahead (VPT la ). Their transitions are guarded by visibly pushdown automata that can check whether the well-nested subword starting at the current position belongs to the language they define. First, we show that VPT la are not more expressive than VPT, but are exponentially more succinct. Second, we show that the class of deterministic VPT la corresponds exactly to the class of functional VPT, yielding a simple characterization of functional VPT. Finally, we show that while VPT la are exponentially more succinct than VPT, checking equivalence of functional VPT la is, as for VPT, ExpT-C. As a consequence, we show that any functional VPT is equivalent to an unambiguous one.

Keywords

Tree Automaton Input Word Tree Transducer Call Transition Return Transition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202–211 (2004)Google Scholar
  2. 2.
    Alur, R., Madhusudan, P.: Adding nesting structure to words. JACM 56(3), 1–43 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007)Google Scholar
  4. 4.
    Eilenberg, S.: Automata, Languages, and Machines. Academic Press, Inc. (1974)Google Scholar
  5. 5.
    Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM Journal of Research and Development 9, 47–68 (1965)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Engelfriet, J.: Top-down tree transducers with regular look-ahead. Mathematical Systems Theory 10, 289–303 (1977)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Engelfriet, J.: On tree transducers for partial functions. Inf. Process. Lett. 7(4), 170–172 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Engelfriet, J., Vogler, H.: Macro tree transducers. JCSS 31(1), 71–146 (1985)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Filiot, E., Raskin, J.-F., Reynier, P.-A., Servais, F., Talbot, J.-M.: Properties of Visibly Pushdown Transducers. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 355–367. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  10. 10.
    Gauwin, O., Niehren, J., Tison, S.: Queries on XML streams with bounded delay and concurrency. Inf. Comput. 209(3), 409–442 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Kumar, V., Madhusudan, P., Viswanathan, M.: Visibly pushdown automata for streaming XML. In: WWW, pp. 1053–1062 (2007)Google Scholar
  12. 12.
    Perst, T., Seidl, H.: Macro forest transducers. IPL 89(3), 141–149 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Sakarovitch, J., de Souza, R.: Lexicographic decomposition of k-valued transducers. TCS 47(3), 758–785 (2010)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Schützenberger, M.P.: Sur les relations rationnelles entre monoides libres. TCS 3(2), 243–259 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Segoufin, L., Vianu, V.: Validating streaming XML documents. In: PODS, pp. 53–64 (2002)Google Scholar
  16. 16.
    Servais, F.: Visibly Pushdown Transducers. PhD thesis, Université Libre de Bruxelles (2011)Google Scholar
  17. 17.
    Staworko, S., Laurence, G., Lemay, A., Niehren, J.: Equivalence of Deterministic Nested Word to Word Transducers. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 310–322. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  18. 18.
    Weber, A.: Decomposing finite-valued transducers and deciding their equivalence. SIAM Journal on Computing 22(1), 175–202 (1993)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Emmanuel Filiot
    • 1
  • Frédéric Servais
    • 2
    • 3
  1. 1.Université Libre de BruxellesBelgium
  2. 2.Hasselt UniversityBelgium
  3. 3.Transnational University of LimburgBelgium

Personalised recommendations