A Kleene theorem for weighted tree automata

Theory of Computing Systems

Volumn 38, Issue 1, 2005, Pages 1-38

  Droste, Manfred ^a   Pech, Christian ^b   Vogler, Heiko ^b  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

IDEMPOTENT; KLEENE THEOREM; RATIONAL TREES; SEMI-RING; TREE SERIES; WEIGHTED TREE;

FORESTRY;

AUTOMATA THEORY;

EID: 18544372263     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1096-z     Document Type: Article

References (47)

1. [Ba] B. S. Baker. Composition of top-down and bottom-up tree transductions. Information and Control, 41:186-213, 1979.
2. [BGW] A. L. Buchsbaum, R. Giancarlo, and J. R. Westbrook. On the determinization of weighted finite automata. SIAM Journal on Computing, 30(5): 1502-1531, 2000.
3. [Bor] B. Borchardt. The Myhill-Nerode theorem for tree series. In Proceedings of the International Conference Developments in Language Theory, DLT '03, volume 2710 of Lecture Notes in Computer Science, pages 146-158. Springer-Verlag, Berlin, 2003.
4. [Boz1] S. Bozapalidis. Equational elements in additive algebras. Theory of Computing Systems, 32:1-33, 1999.
5. [Boz2] S. Bozapalidis. Context-free series on trees. Information and Computation, 169:186-229, 2001.
6. [BR1] J. Berstel and C. Reutenauer. Recognizable formal power series on trees. Theoretical Computer Science, 18:115-148, 1982.
7. [BR2] J. Berstel and Ch. Reutenauer. Rational Series and Their Languages, volume 12 of EATCS Monographs. Springer-Verlag, Berlin, 1988.
8. [Bü] J. R. Büchi. Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 6:66-92, 1960.
9. [BV] B. Borchardt and H. Vogler. Determinization of finite state weighted tree automata. Journal of Automata, Languages and Combinatorics, 8(3):417-463, 2003.
10. [CK] K. Culik and J. Kari. Image compression using weighted finite automata. Computer and Graphics, 17:305-313, 1993.
11. [DK1] M. Droste and D. Kuske. Skew and infinitary formal power series. Technical Report 2002-38, Department of Mathematics and Computer Science, University of Leicester, 2002.
12. [DK2] M. Droste and D. Kuske. Skew and infinitary formal power series. In ICALP 2003, Thirtieth International Colloquium on Automata, Languages and Programming, volume 2719 of Lecture Notes in Computer Science, pages 426-438. Springer-Verlag, Berlin, 2003.
13. [Do] J. Doner. Tree acceptors and some of their applications. Journal of Computer and System Sciences, 4:406-451, 1970.
14. [DV1] M. Droste and H. Vogler. A Kleene theorem for weighted tree automata. Technical Report TUD-FI-02-04, Faculty of Computer Science, Dresden University of Technology, June 2002.
15. [DV2] M. Droste and H. Vogler, editors. Selected papers of the workshop Weighted Automata: Theory and Applications (Dresden University of Technology, March 4-8, 2002). Journal of Automata, Languages and Combinatorics, 8(2): 115-395, 2003.
16. [EFV] J. Engelfriet, Z. Fülöp, and H. Vogler. Bottom-up and top-down tree series transformations. Journal of Automata, Languages and Combinatorics, 1:11-70, 2002.
17. [ÉK] Z. Ésik and W. Kuich. Formal tree series. Journal of Automata, Languages and Combinatorics, 8(2):219-285, 2003.
18. [En1] J. Engelfriet. Bottom-up and top-down tree transformations - a comparison. Mathematical Systems Theory, 9(3):198-231, 1975.
19. [En2] J. Engelfriet. Tree automata and tree grammars. Technical Report DAIMIFN-10, Aarhus University, 1975.
20. [En3] J. Engelfriet. Alternative Kleene theorem for weighted automata. Personal communication, 2003.
21. [ES] J. Engelfriet and E. M. Schmidt. IO and OI.I. Journal of Computer and System Sciences, 15(3):328-353, 1977.
22. [FSW] C. Ferdinand, H. Seidl, and R. Wilhelm. Tree automata for code selection. Acta Informatica, 31:741-760, 1994.
23. [FV] Z. Fülöp and H. Vogler. Tree series transformations that respect copying. Theory of Computing Systems, 36(3):247-293, 2003.
24. [GS1] F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
25. [GS2] F. Gécseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, chapter 1, pages 1-68. Springer-Verlag, Berlin, 1997.
26. [Ha] U. Hafner. Low Bit-Rate Image and Video Coding with Weighted Finite Automata. Ph.D. thesis, Universität Würzburg, Germany, 1999.
27. [JLdV] Z. Jiang, B. Litow, and O. de Vel. Similarity enrichment in image compression through weighted finite automata. In COCOON 2000, volume 1858 of Lecture Notes in Computer Science, pages 447-456. Springer-Verlag, Berlin, 2000.
28. [Ka] F. Katritzke. Refinements of Data Compression using Weighted Finite Automata. Ph.D. thesis, Siegen University, 2001.
29. [K1] S. E. Kleene. Representation of events in nerve nets and finite automata. In C.E. Shannon and J. McCarthy, editors, Automata Studies, pages 3-42. Princeton University Press, Princeton, N.J., 1956.
30. [KS] W. Kuich and A. Salomaa. Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1986.
31. [Ku1] W. Kuich. Semirings and formal power series: their relevance to formal languages and automata. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, chapter 9, pages 609-677. Springer-Verlag, Berlin, 1997.
32. [Ku2] W. Kuich. Formal power series over trees. In S. Bozapalidis, editor, Proceedings of the 3rd International Conference Developments in Language. Theory, pages 61-101. Aristotle University of Thessaloniki, 1998.
33. [Ku3] W. Kuich. Tree transducers and formal tree series. Acta Cybernetica, 14:135-149, 1999.
34. [Ku4] W. Kuich. Formal series over sorted algebras. Discrete Mathematics, 254:231-258, 2002.
35. [Mo] M. Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 23:269-311 (1-42), 1997.
36. [MPR] M. Mohri, F. Pereira, and M. Riley. The design principles of a weighted finite-state transducer library. Theoretical Computer Science, 231:17-32, 2000.
37. [Pec1] Chr. Pech. Kleene-Type Results for Weighted Tree Automata. Ph.D. thesis, Dresden University of Technology, 2003.
38. [Pec2] Chr. Pech. Kleene's theorem for weighted tree-automata. In Proceedings of the 14th International Symposium on Fundamentals of Computation Theory, FCT 2003, Malmö, Sweden, August 13-15, 2003, volume 2751 of Lecture Notes in Computer Science, pages 387-399. Springer-Verlag, Berlin, 2003.
39. [Per] D. Perrin. Finite automata. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 1, pages 3-57. Elsevier B.V., Amsterdam, 1990.
40. [Püs] U. Püschmann. Zu Kostenfunktionen für Büchi-Automaten. Master's thesis, Dresden University of Technology, 2003.
41. [Ro] W. C. Rounds. Mappings and grammars on trees. Mathematical Systems Theory, 4:257-287, 1970.
42. [Sc] M. P. Schützenberger. On the definition of a family of automata. Information and Control, 4:245-270, 1961.
43. [Se1] H. Seidl. Finite tree automata with cost functions. In Proceedings of 17th CAAP, volume 581 of Lecture Notes in Computer Science, pages 279-299. Springer-Verlag, Berlin, 1992.
44. [Se2] H. Seidl. Finite tree automata with cost functions. Theoretical Computer Science, 126:113-142, 1994.
45. [SS] A. Salomaa and M. Soittola. Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer-Verlag, Berlin, 1978.
46. 2 sequential machine maps. Journal of Computer and System Sciences, 4:339-367, 1970.
47. [TW] J. W. Thatcher and J. B. Wright. Generalized finite automata theory with application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57-81, 1968.