What makes some language theory problems undecidable
- 1 August 1970
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 4 (4) , 368-376
- https://doi.org/10.1016/s0022-0000(70)80018-6
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A note on undecidable properties of formal languagesTheory of Computing Systems, 1968
- An Approach to a Unified Theory of AutomataBell System Technical Journal, 1967
- One-way stack automataJournal of the ACM, 1967
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961