Learning multiplicity tree automata

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

Volumn 4201 LNAI, Issue , 2006, Pages 268-280

  Habrard, Amaury ^a   Oncina, Jose ^b  

^a AIX MARSEILLE UNIV   (France)

^b UNIVERSITY OF ALICANTE   (Spain)

Author keywords

Learning from equivalence and membership queries; Multiplicity tree automata; Recognizable tree series

Indexed keywords

FUNCTION EVALUATION; LEARNING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

ANGLUIN'S EXACT MODEL; MEMBERSHIP QUERIES; MULTIPLICITY TREE AUTOMATA; RECOGNIZABLE TREE SERIES;

AUTOMATA THEORY;

EID: 33750309581     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11872436_22     Document Type: Conference Paper

References (15)

1. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)
2. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Available from: http://www.grappa.univ-lille3.fr/tata (1997)
3. Knuutila, T., Steinby, M.: Inference of tree languages from a finite sample: an algebraic approach. Theoretical Computer Science 129(2) (1994) 337-367
4. Garcia, P., Oncina, J.: Inference of recognizable tree sets. Research Report DSIC - II/47/93, Universidad Politécnica de Valencia (1993)
5. Kosala, R., Bruynooghe, M., den Bussche, J.V., Blockeel, H.: Information extraction from web documents based on local unranked tree automaton inference. In: Proceedings of IJCAI 2003. (2003) 403-408
6. Besombes, J., Marion, J.: Learning tree languages from positive examples and membership queries. In: Proceedings of ALT'04, Springer (2004) 440-453
7. Carme, J., Gilleron, R., Lemay, A., Niehren, J.: Interactive learning of node selecting tree transducer. Machine Learning (2006) to appear.
8. Carrasco, R., Oncina, J., Calera-Rubio, J.: Stochastic inference of regular tree languages. Machine Learning 44(1/2) (2001) 185-197
9. Rico-Juan, J., Calera, J., Carrasco, R.: Probabilistic k-testable tree-languages. In: Proceedings of ICGI 2000. Volume 1891 of LNCS., Springer (2000) 221-228
10. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoretical Computer Science 18 (1982) 115-148
11. Esik, Z., Kuich, W.: Formal tree series. Journal of Automata Languages and Combinatorics 8(2) (2003) 219-285
12. Beimel, A., Bergadano, F., Bshouty, N., Kushilevitz, E., Varricchio, S.: Learning functions represented as multiplicity automata. Journal of the ACM 47(3) (2000) 506-530
13. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2) (1987) 87-106
14. Denis, F., Esposito, Y., Habrard, A.: Learning rational stochastic languages. In: Proceedings of COLT'06. (2006) to appear.
15. Denis, F., Esposito, Y.: Rational stochastic language. Technical report, LIF -Université de Provence (2006)