Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:application |
software verification
protocol analysis model inference |
| gptkbp:complexity |
polynomial time
|
| gptkbp:field |
automata theory
computer science formal languages |
| https://www.w3.org/2000/01/rdf-schema#label |
L* algorithm
|
| gptkbp:input |
equivalence queries
membership queries |
| gptkbp:introducedIn |
1987
|
| gptkbp:inventedBy |
gptkb:Dana_Angluin
|
| gptkbp:method |
active learning
|
| gptkbp:notablePublication |
gptkb:Learning_regular_sets_from_queries_and_counterexamples_(Angluin,_1987)
|
| gptkbp:output |
gptkb:deterministic_finite_automaton
|
| gptkbp:purpose |
learning regular languages
|
| gptkbp:relatedTo |
gptkb:finite_automata
regular languages query learning |
| gptkbp:bfsParent |
gptkb:Dana_Angluin
|
| gptkbp:bfsLayer |
6
|