On families of categorial grammars of bounded value, their learnability and related complexity questions
From MaRDI portal
Publication:714784
DOI10.1016/j.tcs.2012.05.016zbMath1252.68169MaRDI QIDQ714784
Henning Fernau, Christophe Costa Florêncio
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.016
finite elasticity; regular tree languages; Hölder norms; parameterized complexity; identification in the limit; grammar induction; categorial grammar
68Q32: Computational learning theory
68Q45: Formal languages and automata
68Q42: Grammars and rewriting systems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
