Finding consistent categorial grammars of bounded value: a parameterized approach

DOI10.1007/978-3-642-13089-2_17MaRDI QIDQ3564861zbMATH OpenOpenAlexFDO

Authors Christophe Costa Florêncio, Henning Fernau

Publication date 26 May 2010

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/268843

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• On families of categorial grammars of bounded value, their learnability and related complexity questions
• On learnability of restricted classes of categorial grammars
• scientific article; zbMATH DE number 2019594
• Logical Aspects of Computational Linguistics
• scientific article; zbMATH DE number 1233727

Cited in

(4)

• scientific article; zbMATH DE number 2019594 (Why is no real title available?)
• scientific article; zbMATH DE number 1499087 (Why is no real title available?)
• 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: Finding consistent categorial grammars of bounded value: a parameterized approach

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