Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Higher order recurrent networks and grammatical inference
Advances in neural information processing systems 2
Random DFA's can be approximately learned from sparse uniform examples
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
The minimum consistent DFA problem cannot be approximated within any polynomial
Journal of the ACM (JACM)
An introduction to genetic algorithms
An introduction to genetic algorithms
A sampling-based heuristic for tree search applied to grammar induction
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
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
What Is the Search Space of the Regular Inference?
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
Inducing grammars from sparse data sets: a survey of algorithms and results
The Journal of Machine Learning Research
Evolving finite state transducers: some initial explorations
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Active Coevolutionary Learning of Deterministic Finite Automata
The Journal of Machine Learning Research
A more bio-plausible approach to the evolutionary inference of finite state machines
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Informative sampling for large unbalanced data sets
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Grammar-based classifier system: a universal tool for grammatical inference
WSEAS Transactions on Computers
A local search algorithm for grammatical inference
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Finite state machine induction using genetic algorithm based on testing and model checking
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Genetic algorithm for induction of finite automata with continuous and discrete output actions
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Automatically composing and parameterizing skills by evolving Finite State Automata
Robotics and Autonomous Systems
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Search-based software engineering: Trends, techniques and applications
ACM Computing Surveys (CSUR)
Hi-index | 0.14 |
Learning a Deterministic Finite Automaton (DFA) from a training set of labeled strings is a hard task that has been much studied within the machine learning community. It is equivalent to learning a regular language by example and has applications in language modeling. In this paper, we describe a novel evolutionary method for learning DFA that evolves only the transition matrix and uses a simple deterministic procedure to optimally assign state labels. We compare its performance with the Evidence Driven State Merging (EDSM) algorithm, one of the most powerful known DFA learning algorithms. We present results on random DFA induction problems of varying target size and training set density. We also study the effects of noisy training data on the evolutionary approach and on EDSM. On noise-free data, we find that our evolutionary method outperforms EDSM on small sparse data sets. In the case of noisy training data, we find that our evolutionary method consistently outperforms EDSM, as well as other significant methods submitted to two recent competitions.