PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance (Q2465033)
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 5221691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance |
scientific article; zbMATH DE number 5221691 |
Statements
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance (English)
0 references
19 December 2007
0 references
computational complexity
0 references
machine learning
0 references
0 references
0 references
0.9404842
0 references
0.91503155
0 references
0.89245534
0 references
0.88563746
0 references
0.8814804
0 references
