scientific article; zbMATH DE number 2019594

MaRDI QIDQ4440386zbMATH OpenFDO

Authors Christophe Costa Florênico

Publication date 17 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2484/24840049.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Grammars and rewriting systems (68Q42) Learning and adaptive systems in artificial intelligence (68T05) Natural language processing (68T50)

Recommendations

• scientific article; zbMATH DE number 1786549
• scientific article; zbMATH DE number 2019598
• scientific article; zbMATH DE number 1670715
• Identification in the limit of categorial grammars
• Finding consistent categorial grammars of bounded value: a parameterized approach

Cited in

(5)

• Polynomial-time identification of very simple grammars from positive data.
• scientific article; zbMATH DE number 1670715 (Why is no real title available?)
• Finding consistent categorial grammars of bounded value: a parameterized approach
• scientific article; zbMATH DE number 1786549 (Why is no real title available?)
• On families of categorial grammars of bounded value, their learnability and related complexity questions

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 Q4440386)