On families of categorial grammars of bounded value, their learnability and related complexity questions
type: Item
instance of: scholarly article
title: On families of categorial grammars of bounded value, their learnability and related complexity questions
zbMATH Open document ID: 1252.68169
author: Christophe Costa Florêncio
author: Henning Fernau
published in: Theoretical Computer Science
publication date: 2012-10-11T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6093010
zbMATH Keywords: grammar induction
zbMATH Keywords: identification in the limit
zbMATH Keywords: finite elasticity
zbMATH Keywords: parameterized complexity
zbMATH Keywords: categorial grammar
zbMATH Keywords: regular tree languages
zbMATH Keywords: Hölder norms
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.05.016
OpenAlex ID: W2058320114
cites work: Q4223176
cites work: Q4393480
cites work: Q3102144
cites work: Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
cites work: Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG
cites work: Categorial grammars determined from linguistic data by unification
cites work: The Mathematics of Sentence Structure
cites work: Q4331781
cites work: k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures
cites work: Comparison of some descriptional complexities of 0L systems obtained by a unifying approach
cites work: Language identification in the limit
cites work: Inductive inference of formal languages from positive data
cites work: Q4763798
cites work: Q4440411
cites work: Ignoring data may be the only way to learn efficiently
cites work: Q4267830
cites work: Q4013550
cites work: Q3219752
cites work: On miniaturized problems in parameterized complexity theory
cites work: Q5710169
cites work: Improved upper bounds for vertex cover
cites work: Q4440386
cites work: Q3270978
cites work: Q3396557
cites work: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology
cites work: Reflections on Multivariate Algorithmics and Problem Parameterization
cites work: The NP-completeness column
cites work: Q4273947
cites work: The graph isomorphism disease
cites work: Inference of Reversible Languages
cites work: Q3907112
cites work: Q4934352
cites work: Q4296748
DOI: 10.1016/J.TCS.2012.05.016
description: scientific article; zbMATH DE number 6093010