Skip to main content
SpringerLink
Log in

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

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975 (MFCS 1975)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 32))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BOASSON L.: An Iteration Theorem for One-Counter Languages. 3 rd Annual Symposium on Theory of Computing (1970) 116–120

    Google Scholar 

  2. BOASSON L.: Two Iteration Theorem for Some Families of Languages. Journal of Computer and System Sciences 7 (1973), 583–596

    Google Scholar 

  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.

    Article  Google Scholar 

  4. BOASSON L.: Languages Algébriques, Paires Iterants et Transductions Rationelles. (to appear).

    Google Scholar 

  5. EILENBERG S.: Communication au Congrés International des Mathématiciens Nice 1970.

    Google Scholar 

  6. GINSBURG S. and S. GREIBACH: Abstract Families of Languages. Memoirs of the American Math. Soc. 87 (1969) — Providence.

    Google Scholar 

  7. GINSBURG S. and S. GREIBACH: Principal A.F.L. Journal of Computer and System Science, 4 (1970), 308–338.

    Google Scholar 

  8. GREIBACH S.: Chain of full — A F L'S. Math. System Theory, 4 (1970), 231–242.

    Article  Google Scholar 

  9. NIVAT M.: Transduction des Languages de Chomsky. Annales de l'Institut Fourier, 18 (1968), 339–456.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Picardie U.E.R de Mathématiques, France

    L. Boasson

Authors
  1. L. Boasson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boasson, L. (1975). On the largest full sub — AFL of the full AFL of context-free languages. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_195

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_195

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07389-5

  • Online ISBN: 978-3-540-37585-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation