Le cylindre des langages lineaires n'est pas principal

  • L. Boasson
  • M. Nivat
Dienstagvormittag Hauptvortrag
Part of the Lecture Notes in Computer Science book series (LNCS, volume 33)


Free Language Nous Donnons Homomorphisme Inverse Supposant Alors 
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.


  1. [1]
    BOASSON L. et M. NIVAT: Sur Diverses Familles de Langages Fermées par Transductions Rationnelles. Acta Informatica, 2, 180–188 (1973).zbMATHGoogle Scholar
  2. [2]
    GINSBURG S.: The Mathematical Theory of Context-Free Languages. Mc Graw Hill (1966).Google Scholar
  3. [3]
    GREIBACH S.: Jump pda's, Deterministic Context-Free Languages, Principal AFDL's and Polynomial Time Recognition. Proc. of 5th Annual ACM Symposium on Theory of Computing, Austin, (Texas), 20–28 (1973).Google Scholar
  4. [4]
    GREIBACH S.: The Hardest Context-Free Language. Siam J. of Comput., 2, no4, 304–330 (1975).MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • L. Boasson
    • 1
  • M. Nivat
    • 2
  1. 1.U.E.R. de MathématiquesUniversité de PicardieFrance
  2. 2.U.E.R. de MathématiquesUniversité Paris 7France

Personalised recommendations