The membership question for ETOL-languages is polynomially complete
- 31 May 1975
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 3 (5) , 138-143
- https://doi.org/10.1016/0020-0190(75)90027-7
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A Relationship between ETOL and EDTOL LanguagesDAIMI Report Series, 1974
- Checking stacks and context-free programmed grammars accept p-complete languagesPublished by Springer Nature ,1974
- A terminological proposalACM SIGACT News, 1974
- TOL systems and languagesInformation and Control, 1973
- Complexity of recognition in intermediate Level languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Programmed Grammars and Classes of Formal LanguagesJournal of the ACM, 1969