Learning regular sets from queries and counterexamples
Information and Computation
Random DFA's can be approximately learned from sparse uniform examples
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
On the learnability of infinitary regular sets
Information and Computation
Learning non-deterministic finite automata from queries and counterexamples
Machine intelligence 13
Learning regular languages using RFSAs
Theoretical Computer Science - Special issue: Algorithmic learning theory
Residual Finite State Automata
Fundamenta Informaticae
A bibliographical study of grammatical inference
Pattern Recognition
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Antichains: a new algorithm for checking universality of finite automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Dimensions in program synthesis
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Angluin style finite state machine inference with non-optimal counterexamples
Proceedings of the First International Workshop on Model Inference In Testing
On the use of non-deterministic automata for presburger arithmetic
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Automated learning of probabilistic assumptions for compositional reasoning
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Towards dual approaches for learning context-free grammars based on syntactic concept lattices
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Inference of residual finite-state tree automata from membership queries and finite positive data
DLT'11 Proceedings of the 15th international conference on Developments in language theory
libalf: the automata learning framework
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Learning stochastic timed automata from sample executions
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Four one-shot learners for regular tree languages and their polynomial characterizability
Theoretical Computer Science
Hi-index | 0.00 |
We introduce NL*, a learning algorithm for inferring non-deterministic finite-state automata using membership and equivalence queries. More specifically, residual finite-state automata (RFSA) are learned similarly as in Angluin's popular L* algorithm, which, however, learns deterministic finite-state automata (DFA). Like in a DFA, the states of an RFSA represent residual languages. Unlike a DFA, an RFSA restricts to prime residual languages, which cannot be described as the union of other residual languages. In doing so, RFSA can be exponentially more succinct than DFA. They are, therefore, the preferable choice for many learning applications. The implementation of our algorithm is applied to a collection of examples and confirms the expected advantage of NL* over L*.