Skip to main content
SpringerLink
Log in

Does o-Substitution Preserve Recognizability?

  • Conference paper
Implementation and Application of Automata (CIAA 2006)

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

Included in the following conference series:

  • 401 Accesses

Abstract

Substitution operations on tree series are at the basis of systems of equations (over tree series) and tree series transducers. Tree series transducers seem to be an interesting transformation device in syntactic pattern matching. In this contribution, it is shown that o-substitution preserves recognizable tree series provided that the target tree series is linear and the semiring is idempotent, commutative, and continuous. This result is applied to prove that the range of the o-t-ts transformation computed by a linear recognizable tree series transducer is pointwise recognizable.

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. Engelfriet, J., Fülöp, Z., Vogler, H.: Bottom-up and top-down tree series transformations. J. Autom. Lang. Combin. 7, 11–70 (2002)

    MATH  Google Scholar 

  2. Rounds, W.C.: Mappings and grammars on trees. Math. Systems Theory 4, 257–287 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  3. Thatcher, J.W.: Generalized2 sequential machine maps. J. Comput. System Sci. 4, 339–367 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  4. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoret. Comput. Sci. 18, 115–148 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kuich, W.: Formal power series over trees. In: Bozapalidis, S. (ed.) Proc. 3rd Int. Conf. Develop. in Lang. Theory, Aristotle University of Thessaloniki, pp. 61–101 (1998)

    Google Scholar 

  6. Irons, E.T.: A syntax directed compiler for ALGOL 60. Commun. ACM 4, 51–55 (1961)

    Article  MATH  Google Scholar 

  7. Morawietz, F., Cornell, T.: The MSO logic-automation connection in linguistics. In: Lecomte, A., Perrier, G., Lamarche, F. (eds.) LACL 1997. LNCS, vol. 1582, pp. 112–131. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  8. Bex, G.J., Maneth, S., Neven, F.: A formal model for an expressive fragment of XSLT. Inform. Systems 27, 21–39 (2002)

    Article  MATH  Google Scholar 

  9. Ferdinand, C., Seidl, H., Wilhelm, R.: Tree automata for code selection. Acta Inform. 31, 741–760 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  10. Seidl, H.: Finite tree automata with cost functions. Theoret. Comput. Sci. 126, 113–142 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  11. López, D., Piñaga, I.: Syntactic pattern recognition by error correcting analysis on tree automata. In: Ferri, F.J., Quereda, J.M.I., Amin, A., Pudil, P. (eds.) SPR 2000 and SSPR 2000. LNCS, vol. 1876, pp. 133–142. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Graehl, J., Knight, K.: Training tree transducers. In: HLT-NAACL, pp. 105–112 (2004)

    Google Scholar 

  13. Borchardt, B.: Code selection by tree series transducers. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 57–67. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Yamada, K., Knight, K.: A syntax-based statistical translation model. In: Proc. 39th Annual Meeting Assoc. Comput. Ling., pp. 523–530. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  15. Brown, P.F., Cocke, J., Della Pietra, S., Della Pietra, V.J., Jelinek, F., Mercer, R.L., Roossin, P.S.: A statistical approach to language translation. In: Proc. 12th Int. Conf. Comput. Ling., pp. 71–76 (1988)

    Google Scholar 

  16. Brown, P.F., Della Pietra, S., Della Pietra, V.J., Mercer, R.L.: The mathematics of statistical machine translation: Parameter estimation. Comput. Linguist. 19, 263–311 (1993)

    Google Scholar 

  17. Fülöp, Z., Vogler, H.: Tree series transformations that respect copying. Theory Comput. Systems 36, 247–293 (2003)

    Article  MATH  Google Scholar 

  18. Bozapalidis, S.: Equational elements in additive algebras. Theory Comput. Systems 32, 1–33 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  19. Kuich, W.: Full abstract families of tree series I. In: Karhumäki, J., Maurer, H.A., Paun, G., Rozenberg, G. (eds.) Jewels Are Forever, pp. 145–156. Springer, Heidelberg (1999)

    Google Scholar 

  20. Ésik, Z., Kuich, W.: Formal tree series. J. Autom. Lang. Combin. 8, 219–285 (2003)

    MATH  Google Scholar 

  21. Borchardt, B.: The Theory of Recognizable Tree Series. PhD thesis, Technische Universität Dresden (2005)

    Google Scholar 

  22. Pech, C.: Kleene-Type Results for Weighted Tree-Automata. PhD thesis, Technische Universität Dresden (2003)

    Google Scholar 

  23. Engelfriet, J.: Tree automata and tree grammars. Technical Report DAIMI FN-10, Aarhus University (1975)

    Google Scholar 

  24. Kuich, W.: Tree transducers and formal tree series. Acta Cybernet 14, 135–149 (1999)

    MATH  MathSciNet  Google Scholar 

  25. Golan, J.S.: Semirings and their Applications. Kluwer Academic, Dordrecht (1999)

    MATH  Google Scholar 

  26. Maletti, A.: Relating tree series transducers and weighted tree automata. Int. J. Found. Comput. Sci. 16, 723–741 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technische Universität Dresden, 01062, Dresden, Germany

    Andreas Maletti

Authors
  1. Andreas Maletti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara

    Oscar H. Ibarra

  2. Dept. of Computer Science, Kainan University, Taoyuan, Taiwan, R.O.C.

    Hsu-Chun Yen

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maletti, A. (2006). Does o-Substitution Preserve Recognizability?. In: Ibarra, O.H., Yen, HC. (eds) Implementation and Application of Automata. CIAA 2006. Lecture Notes in Computer Science, vol 4094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11812128_15

Download citation

  • DOI: https://doi.org/10.1007/11812128_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37213-4

  • Online ISBN: 978-3-540-37214-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation