Query Learning of Regular Tree Languages: How to Avoid Dead States

Authors:
Frank Drewes;Johanna Högberg
Affiliations:
Department of Computing Science, Umea University, S-901\',87 Umea, Sweden;Department of Computing Science, Umea University, S-901\',87 Umea, Sweden
Venue:
Theory of Computing Systems
Year:
2007

Citing 0
Cited 8

Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries

ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness

ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Learning deterministically recognizable tree series

Journal of Automata, Languages and Combinatorics
MAT learners for recognizable tree languages and tree series

Acta Cybernetica
Learning deterministically recognizable tree series: revisited

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
A randomised inference algorithm for regular tree languages

Natural Language Engineering
Learning regular tree languages from correction and equivalence queries

Journal of Automata, Languages and Combinatorics
Four one-shot learners for regular tree languages and their polynomial characterizability

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We generalize an inference algorithm by Angluin, that learns a regular string language from a "minimally adequate teacher", to regular tree languages. The (deterministic bottom-up) finite tree automaton constructed by the learning algorithm is the minimal partial one recognizing the unknown language. This improves a similar algorithm proposed by Sakakibara by avoiding dead states both in the resulting automaton and the learning phase, which also leads to a considerable improvement with respect to efficiency.