Some definitional suggestions for automata theory
- 31 August 1967
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 1 (2) , 187-212
- https://doi.org/10.1016/s0022-0000(67)80014-x
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Stack automata and compilingJournal of the ACM, 1967
- Turing machines with restricted memory accessInformation and Control, 1966
- Sequences in context free languagesIllinois Journal of Mathematics, 1965
- On Ianov's Program SchemataJournal of the ACM, 1964
- Monogenic normal systems are universalJournal of the Australian Mathematical Society, 1963
- Computability of Recursive FunctionsJournal of the ACM, 1963
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961
- How to Program an Infinite AbacusCanadian Mathematical Bulletin, 1961
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959
- A variant of a recursively unsolvable problemBulletin of the American Mathematical Society, 1946