On polynomial-time learnability in the limit of strictly deterministic automata (Q1900980): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 06:10, 5 March 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
