A note on undecidable properties of formal languages
- 1 March 1968
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 2 (1), 1-6
- https://doi.org/10.1007/bf01691341
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An Approach to a Unified Theory of AutomataBell System Technical Journal, 1967
- One-way stack automataJournal of the ACM, 1967
- Abstract families of languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1967
- Deterministic context free languagesInformation and Control, 1966
- The Unsolvability of the Recognition of Linear Context-Free LanguagesJournal of the ACM, 1966
- Ambiguity in context free languagesJournal of the ACM, 1966
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959