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
References (11)
3rd Ann. ACM Symp. on Theory of Computing
(1970)- et al.
Acta. Informatica
(1973) - et al.
Computer programming and formal systems
(1963) Communication au Congrès International des Mathématiciens
(1970)- et al.
IBM J. Res. and Dev.
(1962)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 1974 Published by Elsevier B.V.