Learning a regular tree language from a teacher

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

Volumn 2710, Issue , 2003, Pages 279-291

  Drewes, Frank ^a   Högberg, Johanna ^a  

^a UMEÅ UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORESTRY; INFERENCE ENGINES; TEACHING; TREES (MATHEMATICS);

DEAD STATE; INFERENCE ALGORITHM; REGULAR TREE LANGUAGES; STRING LANGUAGES;

ALGORITHMS;

ALGORITHMS; INFORMATION RETRIEVAL;

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

References (7)

1. Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, 1987.
2. W.S. Brainerd. The minimalization of tree automata. Information and Computation, 13:484-491, 1968.
3. Frank Drewes. Tree-based picture generation. Theoretical Computer Science, 246:1-51, 2000.
4. Joost Engelfriet. Graph grammars and tree transducers. In S. Tison, editor, Proc. CAAP 94, volume 787 of Lecture Notes in Computer Science, pages 15-37. Springer, 1994.
5. L.S. Levy and A.K. Joshi. Skeletal structural descriptions. Information and Control, 39:192-211, 1978.
6. Yasubumi Sakakibara. Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science, 76:223-242, 1990.
7. James W. Thatcher and Jesse B. Wright. Generalized finite automata theory with an application to a decision-problem of second-order logic. Mathematical Systems Theory, 2:57-81, 1968.