Advertisement

Un langage algebrique non-generateur

  • L. Boasson
Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (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].

Keywords

Information Processing Letter Transduction Ration Nous Proposons Maximal Strictement Deterministic Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographie

  1. 1.
    Beauquier, J.: Générateurs Algébriques Non-Ambigus. In: Automata, Languages and Programming. 3rd Colloquium. Edimbourg (1976), p. 66–73Google Scholar
  2. 2.
    Boasson, L.: An Iteration Theorem for One-Counter Languages. 3rd Annual ACM Symposium on Theory of Computing (1970), p. 116–120Google Scholar
  3. 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–140CrossRefGoogle Scholar
  4. 4.
    Boasson, L., Nivat, M.: Sur Diverses Familles de Languages Fermées par transduction Rationnelle. Acta Informatica 2 (1973), p. 180–188Google Scholar
  5. 5.
    Boasson, L., Nivat, M.: Parenthesis Generators. 17th Annual Symposium on Foundations of Computer Sciences (SWAT) — Octobre 1976Google Scholar
  6. 6.
    Ginsburg, S.: The Mathematical Theory of CFL's. McGraw-Hill (1966)Google Scholar
  7. 7.
    Ginsburg, S.: Algebraic and Automata Theoretic Properties of Formal Languages. North-Holland (1975)Google Scholar
  8. 8.
    Greibach, S.: Chains of Full AFL's. Math. System Theory 4, No. 3 (1970), p. 231–242CrossRefGoogle Scholar
  9. 9.
    Greibach, S.: One-Counter Languages and the IRS Condition. J. of Computer and System Sciences 10 (1975), p. 237–247Google Scholar
  10. 10.
    Hopcroft, J.E., Korenjack, A.J.: Simple Deterministic Languages. 7th IEEE Symposium on Swisthing and Automata Theory (1966), p. 36–46Google Scholar
  11. 11.
    Nivat, M.: Transduction des Langages de Chomsky. Anales de l'Institut Fourier 18 (1968), p. 339–456Google Scholar
  12. 12.
    Ogden, W.: A Helpful Result for Proving Inherent Ambiguity. Math. System Theory 2 (1967), p. 191–194CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • L. Boasson

There are no affiliations available

Personalised recommendations