Myhill-Nerode theorem for recognizable tree series revisited

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

Volumn 4957 LNCS, Issue , 2008, Pages 106-120

  Maletti, Andreas ^a,b  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; TREES (MATHEMATICS);

COMMUTATIVE SEMIRING; FINITE INDEX; MYHILL-NERODE CONGRUENCE; TREE SERIES; INFORMATICS; LATIN AMERICAN; MYHILL-NERODE THEOREM; SEMI-RING; SEMIFIELDS; SEMIRINGS; WEIGHTED TREES;

THEOREM PROVING; MATHEMATICAL TRANSFORMATIONS;

EID: 43049127467     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78773-0_10     Document Type: Conference Paper

References (13)

1. Kozen, D.: On the Myhill-Nerode theorem, for trees. Bulletin of the EATCS 47, 170-173 (1992)
2. Eisner, J.: Simpler and more general minimization for weighted finite-state automata. In: HLT-NAACL (2003)
3. Borchardt, B.: The Myhill-Nerode theorem for recognizable tree series. In: Esik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 146-158. Springer, Heidelberg (2003)
4. Hebisch, U., Weinert, H.J.: Semirings - Algebraic Theory and Applications in Computer Science. World Scientific, Singapore (1998)
5. Golan, J.S.: Semirings and their Applications. Kluwer Academic, Dordrecht (1999)
6. Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol. 3406, Springer, Heidelberg (2005)
7. Borchardt, B.: The Theory of Recognizable Tree Series. PhD thesis, Technische Universität Dresden (2005)
8. Drewes, F., Vogler, IL: Learning deterministically recognizable tree series. J. Autom. Lang. Combin (to appear, 2007)
9. Berstel, J., Reutenauer, C.: Rational Series and Their Languages. In: EATCS Monographs on Theoret. Comput. Sci., vol. 12, Springer, Heidelberg (1988)
10. Bozapalidis, S.: Equational elements in additive algebras. Theory Comput. Systems 32(1), 1-33 (1999)
11. Borchardt, B., Vogler, H.: Determinization of finite state weighted tree automata. J. Autom. Lang. Combin. 8(3), 417-463 (2003)
12. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)
13. Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 1-68. Springer, Heidelberg (1997)