On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.tcs.2012.05.016 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.TCS.2012.05.016 / rank | |||
Normal rank |
Revision as of 07:54, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On families of categorial grammars of bounded value, their learnability and related complexity questions |
scientific article |
Statements
On families of categorial grammars of bounded value, their learnability and related complexity questions (English)
0 references
11 October 2012
0 references
grammar induction
0 references
identification in the limit
0 references
finite elasticity
0 references
parameterized complexity
0 references
categorial grammar
0 references
regular tree languages
0 references
Hölder norms
0 references
0 references
0 references
0 references