The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable
From MaRDI portal
Publication:4923557
DOI10.1016/S1571-0661(05)82576-9zbMath1263.68074MaRDI QIDQ4923557
Publication date: 24 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Logic of natural languages (03B65) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42)
Cites Work
This page was built for publication: The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable