Efficient Algorithms for the Inference of Minimum Size DFAs

Authors:
Arlindo L. Oliveira;João P. M. Silva
Affiliations:
IST-INESC/Cadence European Labs, R. Alves Redol 9, Lisboa, Portugal. aml@inesc.pt;IST-INESC/Cadence European Labs, R. Alves Redol 9, Lisboa, Portugal. jpms@inesc.pt
Venue:
Machine Learning
Year:
2001

Citing 25
Cited 9

An assumption-based TMS

Artificial Intelligence
Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Occam's razor

Information Processing Letters
Learning regular sets from queries and counterexamples

Information and Computation
Learning automata from ordered examples

COLT '88 Proceedings of the first annual workshop on Computational learning theory
The Induction of Dynamical Recognizers

Machine Learning - Connectionist approaches to language learning
Random DFA's can be approximately learned from sparse uniform examples

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
The design and analysis of efficient learning algorithms

The design and analysis of efficient learning algorithms
The minimum consistent DFA problem cannot be approximated within any polynomial

Journal of the ACM (JACM)
Learning and extracting finite state automata with second-order recurrent neural networks

Neural Computation
An introduction to Kolmogorov complexity and its applications

An introduction to Kolmogorov complexity and its applications
A fully implicit algorithm for exact state minimization

DAC '94 Proceedings of the 31st annual Design Automation Conference
Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
A new algorithm for the reduction of incompletely specified finite state machines

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Exact Minimization of Binary Decision Diagrams Using Implicit Techniques

IEEE Transactions on Computers
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
How Considering Incompatible State Mergings May Reduce the DFA Induction Search Tree

ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm

ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
A Stochastic Search Approach to Grammar Induction

ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Verification of Synchronous Sequential Machines Based on Symbolic Execution

Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Limits of Exact Algorithms For Inference of Minimum Size Finite State Machines

ALT '96 Proceedings of the 7th International Workshop on Algorithmic Learning Theory
Recursive Learning: An Attractive Alternative to the Decision Tree for Test Genration in Digital Circuits

Proceedings of the IEEE International Test Conference on Discover the New World of Test and Design

LARS: A learning algorithm for rewriting systems

Machine Learning
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
A bibliographical study of grammatical inference

Pattern Recognition
Inference of regular languages using state merging algorithms with search

Pattern Recognition
Learning meets verification

FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Inferring network invariants automatically

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
libalf: the automata learning framework

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Learning finite-state machines from inexperienced teachers

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Learning minimal deterministic automata from inexperienced teachers

ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work describes algorithms for the inference of minimum size deterministic automata consistent with a labeled training set. The algorithms presented represent the state of the art for this problem, known to be computationally very hard.In particular, we analyze the performance of algorithms that use implicit enumeration of solutions and algorithms that perform explicit search but incorporate a set of techniques known as dependency directed backtracking to prune the search tree effectively.We present empirical results that show the comparative efficiency of the methods studied and discuss alternative approaches to this problem, evaluating their advantages and drawbacks.