The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable

DOI10.1016/S1571-0661(05)82576-9MaRDI QIDQ4923557zbMATH OpenFDO

Authors Annie Foret

Publication date 24 May 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1571-0661(05)82576-9

Mathematics Subject Classification ID

Logic of natural languages (03B65) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• The language intersection problem for non-recursive context-free grammars
• Logical Aspects of Computational Linguistics
• scientific article; zbMATH DE number 2019598
• A note on the emptiness of intersection problem for left Szilard languages
• scientific article; zbMATH DE number 1341928

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3727583 (Why is no real title available?)
• scientific article; zbMATH DE number 1233727 (Why is no real title available?)
• scientific article; zbMATH DE number 976409 (Why is no real title available?)
• scientific article; zbMATH DE number 786485 (Why is no real title available?)
• scientific article; zbMATH DE number 3251420 (Why is no real title available?)
• Multimodal linguistic inference
• On the generative capacity of multi-modal categorial grammars
• Product-free Lambek calculus and context-free grammars
• The Mathematics of Sentence Structure

Cited in

(4)

• A note on the emptiness of intersection problem for left Szilard languages
• Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages
• Algorithmic properties of basic categorial grammars with unique category assignment
• On the expressive power of categorial grammars with unique category assignment

This page was built for publication: The emptiness of intersection problem for languages of \(k\)-valued categorial grammars (classical and Lambek) is undecidable

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