A note on AFLs and bounded erasing
- 31 August 1971
- journal article
- Published by Elsevier in Information and Control
- Vol. 19 (1), 18-29
- https://doi.org/10.1016/s0019-9958(71)80004-9
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Time- and tape-bounded turing acceptors and AFLsJournal of Computer and System Sciences, 1970
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Quasi-realtime languagesTheory of Computing Systems, 1970
- Real-Time Computation and Recursive Functions Not Real-Time ComputableIEEE Transactions on Electronic Computers, 1962