scientific article; zbMATH DE number 1786549

zbMATH Open0990.68080MaRDI QIDQ4547846FDOQ4547846

Authors: Christophe Costa Florêncio 

Publication date: 21 August 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2099/20990125

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1670715
• scientific article; zbMATH DE number 2019594
• Three \(\sum^ P_ 2\)-complete problems in computational learning theory
• Finding consistent categorial grammars of bounded value: a parameterized approach
• On families of categorial grammars of bounded value, their learnability and related complexity questions

zbMATH Keywords

learning theorygrammatical inferencecategorial grammarsformal language theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Grammars and rewriting systems (68Q42)

Cited In (4)

• Learning discrete categorial grammars from structures
• Title not available (Why is that?)
• On families of categorial grammars of bounded value, their learnability and related complexity questions
• Learning tree languages from text

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547846)