Learning regular sets from queries and counterexamples
Information and Computation
Learning context-free grammars from structural data in polynomial time
Theoretical Computer Science
Theoretical Computer Science
Graph Grammars and Tree Transducers
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Learning tree languages from positive examples and membership queries
Theoretical Computer Science
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
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Learning deterministically recognizable tree series: revisited
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Generalizing over several learning settings
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Learning regular tree languages from correction and equivalence queries
Journal of Automata, Languages and Combinatorics
Inference of residual finite-state tree automata from membership queries and finite positive data
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Distributional learning of simple context-free tree grammars
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Automated assume-guarantee reasoning for simulation conformance
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Four one-shot learners for regular tree languages and their polynomial characterizability
Theoretical Computer Science
| Hi-index | 0.00 |
We generalize an inference algorithm by Angluin, that learns a regular string language from a "minimally adequate teacher", to regular tree languages. This improves a similar algorithm proposed by Sakakibara. In particular, we show how our algorithm can be used to avoid dead states, thus answering a question by Sakakibara.