The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper
- 31 December 1974
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 2 (5) , 135-139
- https://doi.org/10.1016/0020-0190(74)90050-7
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Chains of full AFL'sTheory of Computing Systems, 1970
- A helpful result for proving inherent ambiguityTheory of Computing Systems, 1968
- Transductions des langages de ChomskyAnnales de l'institut Fourier, 1968