On polynomial-time learnability in the limit of strictly deterministic automata (Q1900980)
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: On polynomial-time learnability in the limit of strictly deterministic automata |
scientific article; zbMATH DE number 810136
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On polynomial-time learnability in the limit of strictly deterministic automata |
scientific article; zbMATH DE number 810136 |
Statements
On polynomial-time learnability in the limit of strictly deterministic automata (English)
0 references
13 February 1996
0 references
polynomial-time learnability
0 references
strictly deterministic automata
0 references
0.8429165482521057
0 references
0.7990719079971313
0 references
