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

https://doi.org/10.1016/0020-0190(74)90050-7Get rights and content

First page preview

First page preview
Click to open first page preview

References (11)

  • L. Boasson

    3rd Ann. ACM Symp. on Theory of Computing

    (1970)
  • L. Boasson et al.

    Acta. Informatica

    (1973)
  • N. Chumsky et al.

    Computer programming and formal systems

    (1963)
  • S. Eilenberg

    Communication au Congrès International des Mathématiciens

    (1970)
  • C.C. Elgot et al.

    IBM J. Res. and Dev.

    (1962)
There are more references available in the full text version of this article.

Cited by (0)

View full text