New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries (Q766158)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6018084
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries |
scientific article; zbMATH DE number 6018084 |
Statements
New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries (English)
0 references
23 March 2012
0 references
equivalence queries
0 references
injective degree
0 references
Myhill-Nerode equivalence
0 references
DFA learning
0 references
LCA algorithm
0 references
0.8446567058563232
0 references
0.8252450823783875
0 references
0.7779781222343445
0 references
0.7779781222343445
0 references
