A relation between space, return and dual return complexities
Open Access
- 1 July 1979
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 9 (1) , 127-140
- https://doi.org/10.1016/0304-3975(79)90010-0
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Writing stack acceptorsJournal of Computer and System Sciences, 1972
- Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automataJournal of Computer and System Sciences, 1971
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- A generalization of context-free determinismInformation and Control, 1967