The theory of languages
- 1 June 1968
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 2 (2) , 97-125
- https://doi.org/10.1007/bf01692510
Abstract
No abstract availableKeywords
This publication has 51 references indexed in Scilit:
- Decidable and Undecidable Questions About AutomataJournal of the ACM, 1968
- Parenthesis GrammarsJournal of the ACM, 1967
- The Independence of Inherent Ambiguity From Complementedness Among Context-Free LanguagesJournal of the ACM, 1966
- The Unsolvability of the Recognition of Linear Context-Free LanguagesJournal of the ACM, 1966
- Preservation of unambiguity and inherent ambiguity in context-free languagesJournal of the ACM, 1966
- Ambiguity in context free languagesJournal of the ACM, 1966
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- Quotients of Context-Free LanguagesJournal of the ACM, 1963
- On ambiguity in phrase structure languagesCommunications of the ACM, 1962
- On The Ambiguity Problem of Backus SystemsJournal of the ACM, 1962