Checking stacks and context-free programmed grammars accept p-complete languages
Authors:
- 1 January 1974
- book chapter
- Published by Springer Nature
- p. 27-33
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- On the time and tape complexity of languages I1973
- Word problems requiring exponential time(Preliminary Report)1973
- The complexity of theorem-proving procedures1971
- Checking automata and one-way stack languagesJournal of Computer and System Sciences, 1969
- Programmed Grammars and Classes of Formal LanguagesJournal of the ACM, 1969