✦ LIBER ✦

The emptiness problem for indexed language is exponential-time complete

✍ Scribed by Shinichi Tanaka; Takumi Kasai

Book ID: 112205568
Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 650 KB
Volume: 17
Category: Article
ISSN: 0882-1666
DOI: 10.1002/scj.4690170904

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On exponential-time completeness of the

On exponential-time completeness of the circularity problem for attribute grammars

✍ Wu, Pei-Chi 📂 Article 📅 2004 🏛 Association for Computing Machinery 🌐 English ⚖ 31 KB

The emptiness of intersection problem fo

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

✍ Annie Foret 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 465 KB

This paper is concerned with usual decidability questions on grammars for some classes of categorial grammars that arise in the field of learning categorial grammars. We prove that the emptiness of intersection of two langages is an undecidable problem for the following classes : k-valued classical