Communications of the ACM
The minimum consistent DFA problem cannot be approximated within any polynomial
Journal of the ACM (JACM)
Recent advances of grammatical inference
Theoretical Computer Science - Special issue on algorithmic learning theory
Problem solving in automata, languages, and complexity
Problem solving in automata, languages, and complexity
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Machine Learning
Machine Learning
Regular Grammatical Inference from Positive and Negative Samples by Genetic Search: the GIG Method
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
Grammatical inference using tabu search
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
Grammatical Evolution: Evolving Programs for an Arbitrary Language
EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
On the Decomposition of Finite Languages
On the Decomposition of Finite Languages
An application of the theory of computational complexity to the study of inductive inference.
An application of the theory of computational complexity to the study of inductive inference.
Learning Deterministic Finite Automata with a Smart State Labeling Evolutionary Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
LARS: A learning algorithm for rewriting systems
Machine Learning
A bibliographical study of grammatical inference
Pattern Recognition
Learning context-free grammars using tabular representations
Pattern Recognition
Parsing Techniques: A Practical Guide
Parsing Techniques: A Practical Guide
| Hi-index | 0.02 |
In this paper, a heuristic algorithmfor the inference of an arbitrary context-free grammar is presented. The input data consist of a finite set of representative words chosen from a (possibly infinite) context-free language and of a finite set of counterexamples--words which do not belong to the language. The time complexity of the algorithm is polynomially bounded.The experiments have been performed for a dozen or so languages investigated by other researchers and our results are reported.