Intersection-closed full AFL and the recursively enumerable languages
Open Access
- 30 April 1973
- journal article
- Published by Elsevier in Information and Control
- Vol. 22 (3) , 201-231
- https://doi.org/10.1016/s0019-9958(73)90274-x
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Multitape AFAJournal of the ACM, 1972
- What makes some language theory problems undecidableJournal of Computer and System Sciences, 1970
- 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