Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings (Q3530185)
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 5352117
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings |
scientific article; zbMATH DE number 5352117 |
Statements
Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings (English)
0 references
16 October 2008
0 references
polynomial learnability
0 references
deterministic finite automata
0 references
balls of strings
0 references
edit distance
0 references
0.7495569586753845
0 references
0.7489454746246338
0 references
0.7489454746246338
0 references
