Advertisement

Strongly connected G-S-M mappings preserving conjugation

  • C. Choffrut
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    C. CHOFFRUT — Transducteurs unilatères et morphismes, Thèse de 3ème cycle, Université Paris VI, 1972.Google Scholar
  2. [2]
    C. CHOFFRUT — Transducteurs conservant l'imprimitivité, in "Automata, Languages and Programming", (M. Nivat, Ed.), North-Holland, Amsterdam.Google Scholar
  3. [3]
    S. EILENBERG — "Automata, Languages and Machines", Vol. A, Academic Press, New-York.Google Scholar
  4. [4]
    S. GINSBURG — "The Mathematical Theory of Context-free Languages", Mc Graw-Hill New-York.Google Scholar
  5. [5]
    A. LENTIN — "Equations dans les monoîdes libres", Gauthier-Villars, 1972.Google Scholar
  6. [6]
    M. NIVAT — Transductions des langages de Chomsky, Ann. Inst. Fourier 18, 339–455Google Scholar
  7. [7]
    M.P. SCHUTZENBERGER — Sur les relations rationnelles fonctionnelles entre monoîdes libres, Theoretical Computer Science, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • C. Choffrut
    • 1
  1. 1.Département de MathématiquesUniversité Paris VIIParis Cedex 05

Personalised recommendations