On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Henning Fernau / rank
Normal rank
 
Property / author
 
Property / author: Henning Fernau / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058320114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3102144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categorial grammars determined from linguistic data by unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematics of Sentence Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of some descriptional complexities of 0L systems obtained by a unifying approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive inference of formal languages from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ignoring data may be the only way to learn efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On miniaturized problems in parameterized complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3270978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph isomorphism disease / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference of Reversible Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296748 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:55, 5 July 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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references