Remarks on blind and partially blind one-way multicounter machines
- 1 December 1978
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 7 (3) , 311-324
- https://doi.org/10.1016/0304-3975(78)90020-8
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Remarks on the complexity of nondeterministic counter languagesTheoretical Computer Science, 1976
- Reversal-bounded multipushdown machinesJournal of Computer and System Sciences, 1974
- Two iteration theorems for some families of languagesJournal of Computer and System Sciences, 1973
- On AFL generators for finitely encoded AFAJournal of Computer and System Sciences, 1973
- A note on AFLs and bounded erasingInformation and Control, 1971
- Tape-bounded turing acceptors and principal AFLsJournal of Computer and System Sciences, 1970
- Principal AFLJournal of Computer and System Sciences, 1970
- Quasi-realtime languagesTheory of Computing Systems, 1970
- Counter machines and counter languagesTheory of Computing Systems, 1968
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961