This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Références
Brzozowski J.A.: Hierarchies of aperiodic languages, RAIRO-Informatique Théorique 10 (1978) 33–49.
Eilenberg, S.: Automata, languages and machines, B, Academic Press (1976) New York.
Perrot, J.F.: Variétés de langages et opérations, Theor. Comput. Science 7 (1978) 197–210.
Reutenauer, C.: Algèbres et séries formelles (en préparation).
Schützenberger, M.P.: On finite monoïds having only trivial subgroups, Information and Control 8 (1965) 190–194.
Simon, I.: Piece wise testable events, in Automata Theory and Formal Languages, 2nd GI Conference, Lecture Notes in Computer Science 33 (1975) 214–222.
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reutenauer, C. (1979). Sur les varietes de langages et de monoïdes. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_27
Download citation
DOI: https://doi.org/10.1007/3-540-09118-1_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09118-9
Online ISBN: 978-3-540-35517-5
eBook Packages: Springer Book Archive