Search Results for author:
Found 3 papers, 1 papers with code
Learning Pairwise Disjoint Simple Languages from Positive Examples
A classical problem in grammatical inference is to identify a deterministic finite automaton (DFA) from a set of positive and negative examples.
Grammatical Inference as a Satisfiability Modulo Theories Problem
The problem of learning a minimal consistent model from a set of labeled sequences of symbols is addressed from a satisfiability modulo theories perspective.
Complementing Model Learning with Mutation-Based Fuzzing
An ongoing challenge for learning algorithms formulated in the Minimally Adequate Teacher framework is to efficiently obtain counterexamples.
Software Engineering
Cannot find the paper you are looking for? You can
Submit a new open access paper.
