Search Results for author:
Found 2 papers, 1 papers with code
Learning Unions of k-Testable Languages
The Galois connection and the metric allow us to derive an efficient algorithm to learn the union of k-TSS languages.
Formal Languages and Automata Theory
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.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
