On the Tape Complexity of Deterministic Context-Free Languages
- 1 July 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 25 (3) , 405-414
- https://doi.org/10.1145/322077.322083
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- An observation on time-storage trade offJournal of Computer and System Sciences, 1974
- Two way deterministic pushdown automaton languages and some open problems in the theory of computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- On two-way multihead automataJournal of Computer and System Sciences, 1973
- On non-determinancy in simple computing devicesActa Informatica, 1972
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Path systems and language recognitionPublished by Association for Computing Machinery (ACM) ,1970
- Some properties of precedence languagesPublished by Association for Computing Machinery (ACM) ,1969
- EditorialInformation and Control, 1967
- Syntactic Analysis and Operator PrecedenceJournal of the ACM, 1963