Skip to main content
SpringerLink
Log in

Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem

  • Conference paper
  • First Online:
Algebraic Informatics (CAI 2019)

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

Included in the following conference series:

  • 384 Accesses

Abstract

We introduce rational weighted tree languages with storage over commutative, complete semirings and show a Kleene-Goldstine theorem.

Z. Fülöp—Research was supported by the “Integrated program for training new generation of scientists in the fields of computer science”, no EFOP-3.6.3-VEKOP-16-2017-0002.

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 EPUB and 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

References

  1. Aho, A.V.: Nested stack automata. J. ACM 16, 383–406 (1969)

    Article  MathSciNet  Google Scholar 

  2. Alexandrakis, A., Bozapalidis, S.: Weighted grammars and Kleene’s theorem. Inf. Process. Lett. 24(1), 1–4 (1987)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Berstel, J., Reutenauer, Ch.: Rational Series and Their Languages. EATCS Monographs on Theoretical Computer Science, vol. 12. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  5. Chomsky, N.: Context-free grammars and pushdown storage. Technical report, MIT Research Lab of Electronics, Quaterly Progress Report 65 (1962)

    Google Scholar 

  6. Comon, H., et al.: Tree automata techniques and applications (2007). http://www.grappa.univ-lille3.fr/tata

  7. Damm, W.: The IO- and OI-hierarchies. Theoret. Comput. Sci. 20, 95–208 (1982)

    Article  MathSciNet  Google Scholar 

  8. Damm, W., Goerdt, A.: An automata-theoretical characterization of the OI-hierarchy. Inf. Control 71, 1–32 (1986)

    Article  MathSciNet  Google Scholar 

  9. Damm, W., Guessarian, I.: Combining T and level-N. In: Gruska, J., Chytil, M. (eds.) MFCS 1981. LNCS, vol. 118, pp. 262–270. Springer, Heidelberg (1981). https://doi.org/10.1007/3-540-10856-4_92

    Chapter  Google Scholar 

  10. Doner, J.E.: Decidability of the weak second-order theory of two successors, Abstract 65T-468. Not. Am. Math. Soc. 12, 819 (1965)

    Google Scholar 

  11. Doner, J.E.: Tree acceptors and some of their applications. J. Comput. Syst. Sci. 4, 406–451 (1970)

    Article  MathSciNet  Google Scholar 

  12. Droste, M., Herrmann, L., Vogler, H.: Weighted automata with storage. Inf. Comput. (accepted for publication)

    Google Scholar 

  13. Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01492-5

    Book  MATH  Google Scholar 

  14. Droste, M., Pech, Chr., Vogler, H.: A Kleene theorem for weighted tree automata. Theory Comput. Syst. 38, 1–38 (2005)

    Article  MathSciNet  Google Scholar 

  15. Eilenberg, S.: Automata, Languages, and Machines. Pure and Applied Mathematics, vol. 59A. Academic Press, New York (1974)

    MATH  Google Scholar 

  16. Engelfriet, J.: Bottom-up and top-down tree transformations - a comparison. Math. Syst. Theory 9(3), 198–231 (1975)

    Article  MathSciNet  Google Scholar 

  17. Engelfriet, J.: Tree automata and tree grammars. Technical report DAIMI FN-10, Institute of Mathematics, University of Aarhus, Department of Computer Science, Ny Munkegade, 8000 Aarhus C, Denmark (1975). See also: arXiv:1510.02036v1 [cs.FL], 7 October 2015

  18. Engelfriet, J.: Two-way automata and checking automata. Math. Centre Tracts 108, 1–69 (1979)

    MathSciNet  MATH  Google Scholar 

  19. Engelfriet, J.: Context-free grammars with storage. Technical report 86-11, University of Leiden (1986). See also: arXiv:1408.0683 [cs.FL] (2014)

  20. Engelfriet, J.: Alternative Kleene theorem for weighted automata. Pers. Commun. (2003)

    Google Scholar 

  21. Engelfriet, J., Vogler, H.: Pushdown machines for the macro tree transducer. Theoret. Comput. Sci. 42(3), 251–368 (1986)

    Article  MathSciNet  Google Scholar 

  22. Engelfriet, J., Vogler, H.: High level tree transducers and iterated pushdown tree transducers. Acta Inform. 26, 131–192 (1988)

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  24. Fülöp, Z., Herrmann, L., Vogler, H.: Weighted regular tree grammars with storage. Discrete Math. Theoret. Comput. Sci. 20(1), \(\#\)26 (2018). http://arxiv.org/abs/1705.06681

  25. Fülöp, Z., Vogler, H.: Weighted tree automata and tree transducers. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. Monographs in Theoretical Computer Science. An EATCS Series, pp. 313–403. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01492-5_9

    Chapter  Google Scholar 

  26. Fülöp, Z., Vogler, H.: Weighted iterated linear control. Acta Inform. (2018) https://doi.org/10.1007/s00236-018-0325-x

  27. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984). See also: arXiv:1509.06233v1 [cs.FL], 21 September 2015

  28. Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Beyond Words, vol. 3, pp. 1–68. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59126-6_1

    Chapter  Google Scholar 

  29. Ginsburg, S.: Algebraic and Automata-theoretic Properties of Formal Languages. North-Holland, Amsterdam (1975)

    MATH  Google Scholar 

  30. Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM 14(2), 389–418 (1967)

    Article  MathSciNet  Google Scholar 

  31. Givant, S., Halmos, P.: Introduction to Boolean Algebras. UTM. Springer, New York (2009). https://doi.org/10.1007/978-0-387-68436-9

    Book  MATH  Google Scholar 

  32. Golan, J.S.: Semirings and Their Applications. Kluwer Academic Publishers, Dordrecht (1999)

    Book  Google Scholar 

  33. Goldstine, J.: Automata with data storage. In: Proceedings of the Conference on Theoretical Computer Science, University of Waterloo, Ontario, Canada, August 1977, pp. 239–246 (1977)

    Google Scholar 

  34. Goldstine, J.: A rational theory of AFLs. In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol. 71, pp. 271–281. Springer, Heidelberg (1979). https://doi.org/10.1007/3-540-09510-1_21

    Chapter  Google Scholar 

  35. Goldstine, J.: Formal languages and their relation to automata: what Hopcroft & Ullman didn’t tell us. In: Book, R.V. (ed.) Formal Language Theory: Perspectives and Open Problems, pp. 109–140. Academic Press, New York (1980)

    Chapter  Google Scholar 

  36. Greibach, S.: Full AFLs and nested iterated substitution. Inf. Control 16, 7–35 (1970)

    Article  MathSciNet  Google Scholar 

  37. Herrmann, L., Vogler, H.: A Chomsky-Schützenberger theorem for weighted automata with storage. In: Maletti, A. (ed.) CAI 2015. LNCS, vol. 9270, pp. 115–127. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-23021-4_11

    Chapter  Google Scholar 

  38. Kambites, M.: Formal languages and groups as memory. Commun. Algebra 37(1), 193–208 (2009)

    Article  MathSciNet  Google Scholar 

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

    Chapter  Google Scholar 

  40. Kuich, W.: Formal power series over trees. In: Bozapalidis, S. (ed.) Proceedings of the 3rd International Conference on Developments in Language Theory, DLT 1997, Thessaloniki, Greece, pp. 61–101. Aristotle University of Thessaloniki (1998)

    Google Scholar 

  41. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol. 5. Springer, Heidelberg (1986). https://doi.org/10.1007/978-3-642-69959-7

    Book  MATH  Google Scholar 

  42. Maslov, A.N.: Multilevel stack automata. Probl. Inf. Transm. 12, 38–43 (1976)

    Google Scholar 

  43. Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)

    Book  Google Scholar 

  44. Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer, New York (1978). https://doi.org/10.1007/978-1-4612-6264-0

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  46. Scott, D.: Some definitional suggestions for automata theory. J. Comput. Syst. Sci. 1, 187–212 (1967)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  48. Van Leeuwen, J.: Variations of a new machine model. In: Proceedings of the 17th FOCS, pp. 228–235 (1976)

    Google Scholar 

  49. Vogler, H., Droste, M., Herrmann, L.: A weighted MSO logic with storage behaviour and its Büchi-Elgot-Trakhtenbrot theorem. In: Dediu, A.-H., Janoušek, J., Martín-Vide, C., Truthe, B. (eds.) LATA 2016. LNCS, vol. 9618, pp. 127–139. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-30000-9_10

    Chapter  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Szeged, Szeged, Hungary

    Zoltán Fülöp

  2. Technische Universität Dresden, Dresden, Germany

    Heiko Vogler

Authors
  1. Zoltán Fülöp
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Heiko Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Heiko Vogler .

Editor information

Editors and Affiliations

  1. University of Niš, Niš, Serbia

    Miroslav Ćirić

  2. University of Leipzig , Leipzig, Germany

    Manfred Droste

  3. Université Paris Denis Diderot and CNRS, Paris, France

    Jean-Éric Pin

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fülöp, Z., Vogler, H. (2019). Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem. In: Ćirić, M., Droste, M., Pin, JÉ. (eds) Algebraic Informatics. CAI 2019. Lecture Notes in Computer Science(), vol 11545. Springer, Cham. https://doi.org/10.1007/978-3-030-21363-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-21363-3_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-21362-6

  • Online ISBN: 978-3-030-21363-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation