𝔖 Bobbio Scriptorium

✦ LIBER ✦

The membership question for ETOL-languages is polynomially complete

✍ Scribed by Jan Van Leeuwen

Book ID: 113161798
Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 801 KB
Volume: 3
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(75)90027-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The emptiness problem for indexed langua

The emptiness problem for indexed language is exponential-time complete

✍ Shinichi Tanaka; Takumi Kasai 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 650 KB

[Lecture Notes in Computer Science] STAC

[Lecture Notes in Computer Science] STACS 2002 Volume 2285 || The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL

✍ Alt, Helmut; Ferreira, Afonso 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg ⚖ 543 KB

Year Book of the American Pharmaceutical

Year Book of the American Pharmaceutical Association. This is the Report on the Progress of Pharmacy for 1919, Volume 8, Containing the Sixty-Second Annual Report on the Progress of Pharmacy, the Constitution and by-Laws of the American Pharmaceutical Association and Roll of its Membership up to October 1921. A Complete Report of the Treasurer A. Ph. A., for the year 1918, is also Included. Reproduction of a Photograph of Prof. L. E. Sayre, President of the Association, 1919–1920, is the frontispiece

📂 Article 📅 1922 🏛 Elsevier ⚖ 107 KB