On the largest full sub — AFL of the full AFL of context-free languages

  • L. Boasson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 32)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    BOASSON L.: An Iteration Theorem for One-Counter Languages. 3 rd Annual Symposium on Theory of Computing (1970) 116–120Google Scholar
  2. 2.
    BOASSON L.: Two Iteration Theorem for Some Families of Languages. Journal of Computer and System Sciences 7 (1973), 583–596Google Scholar
  3. 3.
    BOASSON L.: The Inclusion of the Substitution Closure of Linear and One-Counter Languages in the Largest Sub — A F L of the family of Context-Free Languages is Proper. Information News Letters, 2 (1973), 135–140.CrossRefGoogle Scholar
  4. 4.
    BOASSON L.: Languages Algébriques, Paires Iterants et Transductions Rationelles. (to appear).Google Scholar
  5. 5.
    EILENBERG S.: Communication au Congrés International des Mathématiciens Nice 1970.Google Scholar
  6. 6.
    GINSBURG S. and S. GREIBACH: Abstract Families of Languages. Memoirs of the American Math. Soc. 87 (1969) — Providence.Google Scholar
  7. 7.
    GINSBURG S. and S. GREIBACH: Principal A.F.L. Journal of Computer and System Science, 4 (1970), 308–338.Google Scholar
  8. 8.
    GREIBACH S.: Chain of full — A F L'S. Math. System Theory, 4 (1970), 231–242.CrossRefGoogle Scholar
  9. 9.
    NIVAT M.: Transduction des Languages de Chomsky. Annales de l'Institut Fourier, 18 (1968), 339–456.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • L. Boasson
    • 1
  1. 1.Université de Picardie U.E.R de MathématiquesFrance

Personalised recommendations