Skip to main content
SpringerLink
Log in

Kleene’s Theorem for Weighted Tree-Automata

  • Conference paper
Fundamentals of Computation Theory (FCT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2751))

Included in the following conference series:

Abstract

We sketch the proof of a Kleene-type theorem for formal tree-series over commutative semirings. That is, for a suitable set of rational operations we show that the proper rational formal tree-series coincide with the recognizable ones. A complete proof is part of the PhD-thesis of the author, which is available at [9].

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. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoretical Computer Science 18, 115–148 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bloom, S.L., Ésik, Z.: An extension theorem with an application to formal tree series. BRICS Report Series RS-02-19, University of Aarhus (2002)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Culik, K., Kari, J.: Image compression using weighted finite automata. Computer and Graphics 17, 305–313 (1993)

    Article  Google Scholar 

  5. Droste, M., Vogler, H.: A Kleene theorem for weighted tree automata. technical report TUD-FI02-04, Technische Universität Dresden (2002)

    Google Scholar 

  6. Kleene, S.E.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3–42. Princeton University Press, Princeton (1956)

    Google Scholar 

  7. Kuich, W.: Formal power series over trees. In: Proc. of the 3rd International Conference Developments in Language Theory, Aristotle University of Thesaloniki, pp. 60–101 (1997)

    Google Scholar 

  8. Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23, 269–311 (1997)

    MathSciNet  Google Scholar 

  9. Pech, C.: Kleene-type results for weighted tree-automata. Dissertation, TU-Dresden (2003), http://www.math.tu-dresden.de/~pech/diss.ps

  10. Schützenberger, M.P.: On the definition of a family of automata. Information and Control 4, 245–270 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  11. Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with application to a decision problem of second-order logic. Math. Systems Theory 2, 57–81 (1968)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Mathematik und Naturwissenschaften, Technische Universität Dresden, D-01062, Dresden, Germany

    Christian Pech

Authors
  1. Christian Pech
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Lund University, 22100, Lund, Sweden

    Andrzej Lingas

  2. School of Technology and Society, Malmö University, SE-205 06, Malmö, Sweden

    Bengt J. Nilsson

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pech, C. (2003). Kleene’s Theorem for Weighted Tree-Automata. In: Lingas, A., Nilsson, B.J. (eds) Fundamentals of Computation Theory. FCT 2003. Lecture Notes in Computer Science, vol 2751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45077-1_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45077-1_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40543-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation