Preview
Unable to display preview. Download preview PDF.
References
C. CHOFFRUT — Transducteurs unilatères et morphismes, Thèse de 3ème cycle, Université Paris VI, 1972.
C. CHOFFRUT — Transducteurs conservant l'imprimitivité, in "Automata, Languages and Programming", (M. Nivat, Ed.), North-Holland, Amsterdam.
S. EILENBERG — "Automata, Languages and Machines", Vol. A, Academic Press, New-York.
S. GINSBURG — "The Mathematical Theory of Context-free Languages", Mc Graw-Hill New-York.
A. LENTIN — "Equations dans les monoîdes libres", Gauthier-Villars, 1972.
M. NIVAT — Transductions des langages de Chomsky, Ann. Inst. Fourier 18, 339–455
M.P. SCHUTZENBERGER — Sur les relations rationnelles fonctionnelles entre monoîdes libres, Theoretical Computer Science, to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choffrut, C. (1976). Strongly connected G-S-M mappings preserving conjugation. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_178
Download citation
DOI: https://doi.org/10.1007/3-540-07854-1_178
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07854-8
Online ISBN: 978-3-540-38169-3
eBook Packages: Springer Book Archive