Skip to main content
SpringerLink
Log in

Normalization of Sequential Top-Down Tree-to-Word Transducers

  • Conference paper
Language and Automata Theory and Applications (LATA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6638))

Abstract

We study normalization of deterministic sequential top-down tree-to-word transducers (stWs), that capture the class of deterministic top-down nested-word to word transducers. We identify the subclass of earliest stWs (estWs) that yield unique normal forms when minimized. The main result of this paper is an effective normalization procedure for stWs. It consists of two stages: we first convert a given stW to an equivalent estW, and then, we minimize the estW.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Chapter  Google Scholar 

  2. Berstel, J., Boasson, L.: Transductions and context-free languages. Teubner Studienbucher (1979)

    Google Scholar 

  3. Choffru, C.: Contribution à l’étude de quelques familles remarquables de fonctions rationnelles. PhD thesis, Université de Paris VII (1978)

    Google Scholar 

  4. Choffrut, C.: Minimizing subsequential transducers: a survey. Theoretical Computer Science 292(1), 131–143 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Engelfriet, J., Maneth, S., Seidl, H.: Deciding equivalence of top-down XML transformations in polynomial time. Journal of Computer and System Science 75(5), 271–286 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Friese, S., Seidl, H., Maneth, S.: Minimization of deterministic bottom-up tree transducers. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 185–196. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Griffiths, T.V.: The unsolvability of the equivalence problem for lambda-free nondeterministic generalized machines. Journal of the ACM 15(3), 409–413 (1968)

    Article  MATH  Google Scholar 

  9. Gurari, E.M.: The equivalence problem for deterministic two-way sequential transducers is decidable. SIAM Journal on Computing 11(3), 448–452 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)

    MATH  Google Scholar 

  11. Lemay, A., Maneth, S., Niehren, J.: A learning algorithm for top-down xml transformations. In: ACM Symposium on Principles of Database Systems (PODS), pp. 285–296 (2010)

    Google Scholar 

  12. Lothaire, M. (ed.): Combinatorics on Words, 2nd edn. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  13. Maneth, S.: Models of Tree Translation. PhD thesis, Leiden University (2003)

    Google Scholar 

  14. Martens, W., Neven, F., Gyssens, M.: Typechecking top-down XML transformations: Fixed input or output schemas. Information and Computation 206(7), 806–827 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Raskin, J.-F., Servais, F.: Visibly pushdown transducers. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 386–397. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mostrare project, INRIA & LIFL (CNRS UMR8022), France

    Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Sławek Staworko & Marc Tommasi

  2. University of Lille, France

    Grégoire Laurence, Aurélien Lemay, Sławek Staworko & Marc Tommasi

  3. INRIA, Lille, France

    Joachim Niehren

Authors
  1. Grégoire Laurence
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aurélien Lemay
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joachim Niehren
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sławek Staworko
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Marc Tommasi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

  2. Department of Informatics, Kyushu University, 744 Motooka, 819–0395, Fukuoka, Japan

    Shunsuke Inenaga

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laurence, G., Lemay, A., Niehren, J., Staworko, S., Tommasi, M. (2011). Normalization of Sequential Top-Down Tree-to-Word Transducers. In: Dediu, AH., Inenaga, S., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2011. Lecture Notes in Computer Science, vol 6638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21254-3_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21254-3_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21253-6

  • Online ISBN: 978-3-642-21254-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation