?-productions in context-free grammars
- 1 November 1981
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 16 (3), 303-308
- https://doi.org/10.1007/bf00289308
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A space efficient algorithm for the monotone planar circuit value problemInformation Processing Letters, 1980
- Linear programming is log-space hard for PInformation Processing Letters, 1979
- A unified approach to models of synchronous parallel machinesPublished by Association for Computing Machinery (ACM) ,1978
- The monotone and planar circuit value problems are log space complete for PACM SIGACT News, 1977
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- Hierarchies of complete problemsActa Informatica, 1976
- The circuit value problem is log space complete for PACM SIGACT News, 1975
- An observation on time-storage trade offJournal of Computer and System Sciences, 1974
- Memory bounds for recognition of context-free and context-sensitive languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965