Learning regular sets from queries and counterexamples
Information and Computation
The minimum consistent DFA problem cannot be approximated within and polynomial
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Learning Regular Languages Using Non Deterministic Finite Automata
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Learning Context-Free Grammars from Partially Structured Examples
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Residual Finite State Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Towards High Speed Grammar Induction on Large Text Corpora
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Succinctness of descriptions of context-free, regular and finite languages.
Succinctness of descriptions of context-free, regular and finite languages.
Query Learning of Regular Tree Languages: How to Avoid Dead States
Theory of Computing Systems
Learning tree languages from positive examples and membership queries
Theoretical Computer Science
Bisimulation relations for weighted automata
Theoretical Computer Science
Learning Regular Languages Using Nondeterministic Finite Automata
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
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
Identification in the limit of substitutable context-free languages
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
A family of algorithms for non deterministic regular languages inference
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Learning multiplicity tree automata
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
| Hi-index | 0.01 |
We present a randomised inference algorithm for regular tree languages. The algorithm takes as input two disjoint finite nonempty sets of trees ???? and ???? and outputs a nondeterministic finite tree automaton that accepts every tree in ???? and rejects every tree in ????. The output automaton typically represents a nontrivial generalisation of the examples given in ???? and ????. To obtain compact output automata, we use a heuristics similar to bisimulation minimisation. The algorithm has time complexity of $\ordo{\negsize \cdot \possize^2}$, where n???? and n???? are the size of ???? and ????, respectively. Experiments are conducted on a prototype implementation, and the empirical results appear to second the theoretical results.