A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
- 1 October 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 22 (4), 499-500
- https://doi.org/10.1145/321906.321913
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On tape-bounded complexity classes and multihead finite automataJournal of Computer and System Sciences, 1975
- The Hardest Context-Free LanguageSIAM Journal on Computing, 1973
- Finite-Turn Pushdown AutomataSIAM Journal on Control, 1966