Space-bounded complexity classes and iterated deterministic substitution
- 31 March 1980
- journal article
- Published by Elsevier in Information and Control
- Vol. 44 (3) , 282-299
- https://doi.org/10.1016/s0019-9958(80)90172-2
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Extended linear macro grammars, iteration grammars, and register programsActa Informatica, 1979
- Stack languages and log n spaceJournal of Computer and System Sciences, 1978
- Recognition of deterministic ETOL languages in logarithmic spaceInformation and Control, 1977
- Controlled iteration grammars and full hyper-AFL'sInformation and Control, 1977
- Iterated deterministic substitutionActa Informatica, 1977
- Reversal-bounded multipushdown machinesJournal of Computer and System Sciences, 1974
- On Languages Accepted in Polynomial TimeSIAM Journal on Computing, 1972
- Language recognition by marking automataInformation and Control, 1972
- Time- and tape-bounded turing acceptors and AFLsJournal of Computer and System Sciences, 1970
- Studies in abstract families of languagesMemoirs of the American Mathematical Society, 1969