An Infinite Hierarchy of Context-Free Languages
- 1 January 1969
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 16 (1), 91-106
- https://doi.org/10.1145/321495.321503
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- An Approach to a Unified Theory of AutomataBell System Technical Journal, 1967
- Finite-Turn Pushdown AutomataSIAM Journal on Control, 1966
- A Turing Machine SimulatorJournal of the ACM, 1965
- Phrase structure languages, finite machines, and channel capacityInformation and Control, 1963
- 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