An Approach to a Unified Theory of Automata
- 1 October 1967
- journal article
- website
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Bell System Technical Journal
- Vol. 46 (8), 1793-1829
- https://doi.org/10.1002/j.1538-7305.1967.tb03172.x
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- One-way stack automataJournal of the ACM, 1967
- Two results on one-way stack automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1967
- Indexed grammars -- An extension of context free grammarsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1967
- Stack automata and compilingJournal of the ACM, 1967
- Deterministic context free languagesInformation and Control, 1966
- Memory bounds for recognition of context-free and context-sensitive languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965
- Real-Time Computation and Recursive Functions Not Real-Time ComputableIEEE Transactions on Electronic Computers, 1962
- Finite counting automataInformation and Control, 1962
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959