The Myhill-Nerode theorem for recognizable tree series

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2710, Issue , 2003, Pages 146-158

  Borchardt, Björn ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BOTTOM UP; FINITE STATE; MYHILL-NERODE THEOREM; NUMBER OF STATE; SEMIFIELD; SEMIFIELDS; TREE SERIES; WEIGHTED TREE;

FORESTRY;

ALGORITHMS; PROBLEM SOLVING;

EID: 35248870581     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45007-6_11     Document Type: Article

References (23)

1. J. Berstel and C. Reutenauer. Recognizable formal power series on trees. Theoretical Computer Science, 18:115-148, 1982.
2. J. Berstel and Ch. Reutenauer. Rational Series and Their Languages, volume 12 of EATCS-Monographs. Springer Verlag, 1988.
3. B. Borchardt and H. Vogler. Determinization of Finite State Weighted Tree Automata. J. Automata, Languages and Combinatorics, accepted, 2003.
4. S. Bozapalidis. Effective constuction of the syntactic algebra of a recognizable series on trees. Acta Informatica, 28:351-363, 1991.
5. J. Doner. Tree acceptors and some of their applications. J. Comput. System Sci., 4:406-451, 1970.
6. M. Droste and P. Gastin. The Kleene-Schützenberger theorem for formal power series in partially commuting variables. Information and Computation, 153:47-80, 1999.
7. extended abstract in: 24th ICALP, LNCS vol. 1256, Springer, 1997, pp. 682-692.
8. 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.
9. S. Eilenberg. Automata, Languages, and Machines, Vol.A. Academic Press, 1974.
10. Z. Esik and W. Kuich. Formal Tree Series. J. Automata, Languages and Combinatorics, accepted, 2003.
11. Z. Fülöp and S. Vágvölgyi. Congruential tree languages are the same as recognizable tree languages. Bulletin of EATCS, 30:175-185, 1989.
12. Z. Fülöp and H. Vogler. Tree series transformations that respect copying. Theory of Computing Systems, to appear, 2003.
13. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
14. 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, 1997.
15. D. Kozen. On the Myhill-Nerode theorem for trees. EATCS Bulletin, 47:170-173, June 1992.
16. W. Kuich. Formal power series over trees. In S. Bozapalidis, editor, Proc. of the 3rd International Conference Developments in Language Theory, pages 61-101. Aristotle University of Thessaloniki, 1998.
17. W. Kuich and A. Salomaa. Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, Springer Verlag, 1986.
18. M. Magidor and G. Moran. Finite automata over finite trees. Technical Report 30, Hebrew University, Jerusalem, 1969.
19. M. Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 23:269-311 (1-42), 1997.
20. M. O. Rabin. Decidability of second-order theories and automata in infinite trees. Transactions of the Amer. Math. Soc., 141:1-35, 1969.
21. M.P. Schützenberger. On the definition of a family of automata. Information and Control, 4:245-270, 1961.
22. H. Seidl. Finite tree automata with cost functions. Theoret. Comput. Sci., 126:113-142, 1994.
23. J.W. Thatcher and J.B. Wright. Generalized finite automata theory with application to a decision problem of second-order logic. Math. Systems Theory, 2(1):57-81, 1968.