Consistent identification in the limit of any of the classes \(k\)-valued is NP-hard (Q4547846)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1786549
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Consistent identification in the limit of any of the classes \(k\)-valued is NP-hard |
scientific article; zbMATH DE number 1786549 |
Statements
21 August 2002
0 references
categorial grammars
0 references
formal language theory
0 references
grammatical inference
0 references
learning theory
0 references
0.8963809609413147
0 references
0.8716118335723877
0 references
0.8716115951538086
0 references
0.7786763906478882
0 references
Consistent identification in the limit of any of the classes \(k\)-valued is NP-hard (English)
0 references
