On polynomial-time learnability in the limit of strictly deterministic automata (Q1900980): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:53, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On polynomial-time learnability in the limit of strictly deterministic automata |
scientific article |
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
