A family of languages which is polynomial-time learnable from positive data in pitt's sense (Q2710786): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Language identification in the limit / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198075 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The grammatical inference problem for the Szilard languages of linear grammars / rank | |||
Normal rank | |||
Latest revision as of 16:44, 3 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A family of languages which is polynomial-time learnable from positive data in pitt's sense |
scientific article |
Statements
A family of languages which is polynomial-time learnable from positive data in pitt's sense (English)
0 references
19 December 2002
0 references
formal languages
0 references
computational learning theory
0 references
polynomial-time learnability in the limit
0 references
implicit error of prediction
0 references
Szilard language
0 references
