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

Annie Foret. The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable. Electronic Notes in Theoretical Computer Science, 53:81-93, 2001. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.