PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance (Q2465033)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance |
scientific article |
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
