Uniform characterizations of non-uniform complexity measures
Information and Control
Learning regular sets from queries and counterexamples
Information and Computation
A time complexity gap for two-way probabilistic finite-state automata
SIAM Journal on Computing
Random DFA's can be approximately learned from sparse uniform examples
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
An introduction to computational learning theory
An introduction to computational learning theory
Automaticity I: properties of a measure of descriptional complexity
Journal of Computer and System Sciences
Model checking
Minimal cover-automata for finite languages
Theoretical Computer Science
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Inference of Finite Automata Using Homing Sequences
Machine Learning: From Theory to Applications - Cooperative Research at Siemens and MIT
An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Minimal Cover-Automata for Finite Languages
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
On the Minimality of Finite Automata and Stream X-machines for Finite Languages
The Computer Journal
Incremental construction of minimal deterministic finite cover automata
Theoretical Computer Science - Implementation and application of automata
THE QSM ALGORITHM AND ITS APPLICATION TO SOFTWARE BEHAVIOR MODEL INDUCTION
Applied Artificial Intelligence
Bounded sequence testing from deterministic finite state machines
Theoretical Computer Science
On minimizing cover automata for finite languages in O(n log n) time
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Bounded sequence testing from non-deterministic finite state machines
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Regular inference for state machines with parameters
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
Learn and test for event-b --- a rodin plugin
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
Model learning and test generation for event-b decomposition
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
| Hi-index | 0.00 |
Learning regular languages from queries was introduced by Angluin in a seminal paper that also provides the L^@? algorithm. This algorithm, as well as other existing inference methods, finds the exact language accepted by the automaton. However, when only finite languages are used, the construction of a deterministic finite cover automaton (DFCA) is sufficient. A DFCA of a finite language U is a finite automaton that accepts all sequences in U and possibly other sequences that are longer than any sequence in U. This paper presents an algorithm, called L^l, that finds a minimal DFCA of an unknown finite language in polynomial time using membership and language queries, a non-trivial adaptation of Angluin@?s L^@? algorithm. As the size of a minimal DFCA of a finite language U may be much smaller than the size of the minimal automaton that accepts exactly U, L^l can provide substantial savings over existing automata inference methods.