Remarks on the complexity of nondeterministic counter languages
- 30 April 1976
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1 (4), 269-288
- https://doi.org/10.1016/0304-3975(76)90072-4
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Translational lemmas, polynomial time, and (log n)j-spaceTheoretical Computer Science, 1976
- Comparing complexity classesJournal of Computer and System Sciences, 1974
- On two-way multihead automataJournal of Computer and System Sciences, 1973
- On Languages Accepted in Polynomial TimeSIAM Journal on Computing, 1972
- A note on AFLs and bounded erasingInformation and Control, 1971
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Tape-bounded turing acceptors and principal AFLsJournal of Computer and System Sciences, 1970
- Some Results on Tape-Bounded Turing MachinesJournal of the ACM, 1969
- Counter machines and counter languagesTheory of Computing Systems, 1968
- Time and tape complexity of pushdown automaton languagesInformation and Control, 1968