Learning deterministic finite automata from smallest counterexamples (Q2706180)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Learning deterministic finite automata from smallest counterexamples |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Learning deterministic finite automata from smallest counterexamples |
scientific article |
Statements
19 March 2001
0 references
learning from smallest counterexamples
0 references
self-directed learning
0 references
deterministic finite automata
0 references
multiplicity automata
0 references
Learning deterministic finite automata from smallest counterexamples (English)
0 references
