Skip to main content
SpringerLink
Log in

Un langage algebrique non-generateur

  • Vorträge In Der Reihenfolge Des Programms
  • Conference paper
  • First Online:
Book cover Theoretical Computer Science

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

Abstract

We give an example of a context-free language LO which is not a full generator of the CFL's family though it is expansive and meeting the IRS condition [9]. We get then a counter-example to a conjecture of S. Greibach [9] which can be compared to a positive result dealing with the same questions concerning parenthesis languages [5].

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.

Bibliographie

  1. Beauquier, J.: Générateurs Algébriques Non-Ambigus. In: Automata, Languages and Programming. 3rd Colloquium. Edimbourg (1976), p. 66–73

    Google Scholar 

  2. Boasson, L.: An Iteration Theorem for One-Counter Languages. 3rd Annual ACM Symposium on Theory of Computing (1970), p. 116–120

    Google Scholar 

  3. Boasson, L.: The Inclusion of the Substitution Closure of Linear and One-Counter Languages in the Largest Sub. AFL of the Family of CFL's is proper. Information Processing Letters, 2, No. 5 (1973), p. 135–140

    Article  Google Scholar 

  4. Boasson, L., Nivat, M.: Sur Diverses Familles de Languages Fermées par transduction Rationnelle. Acta Informatica 2 (1973), p. 180–188

    Google Scholar 

  5. Boasson, L., Nivat, M.: Parenthesis Generators. 17th Annual Symposium on Foundations of Computer Sciences (SWAT) — Octobre 1976

    Google Scholar 

  6. Ginsburg, S.: The Mathematical Theory of CFL's. McGraw-Hill (1966)

    Google Scholar 

  7. Ginsburg, S.: Algebraic and Automata Theoretic Properties of Formal Languages. North-Holland (1975)

    Google Scholar 

  8. Greibach, S.: Chains of Full AFL's. Math. System Theory 4, No. 3 (1970), p. 231–242

    Article  Google Scholar 

  9. Greibach, S.: One-Counter Languages and the IRS Condition. J. of Computer and System Sciences 10 (1975), p. 237–247

    Google Scholar 

  10. Hopcroft, J.E., Korenjack, A.J.: Simple Deterministic Languages. 7th IEEE Symposium on Swisthing and Automata Theory (1966), p. 36–46

    Google Scholar 

  11. Nivat, M.: Transduction des Langages de Chomsky. Anales de l'Institut Fourier 18 (1968), p. 339–456

    Google Scholar 

  12. Ogden, W.: A Helpful Result for Proving Inherent Ambiguity. Math. System Theory 2 (1967), p. 191–194

    Article  Google Scholar 

Download references

Authors
  1. L. Boasson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boasson, L. (1977). Un langage algebrique non-generateur. In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-08138-0_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08138-8

  • Online ISBN: 978-3-540-37389-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation