Chapter PDF
Keywords
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.
References
S. Eilenberg, Automata, languages and Machines, Academic Press, Vol B (1976)
M. Hall Jr., A topology for free groups and related groups, Ann. Math. 52 (1950) 127–139.
S.W. Margolis and J.E. Pin, Languages and inverse semigroups, 11th ICALP INCS 172, (1984), 337–346.
J.E. Pin, Variétés de langages formels, Masson, Paris (1984)
Ch. Reutenauer, Une topologie du monoïde libre, Semigroup Forum 18, (1979) 33–49.
Ch. Reutenauer, Sur mon article “une topologie du monoïde libre”, Semigroup Forum 22, (1981), 93–95.
J. Rhodes and B. Tilson, Improved lower bounds for complexity of finite semigroups, Journal of Pure and Applied Algebra 2 (1972), 13–71.
D. Scott, Infinite words, unpublished.
H. Straubing, Families of recognizable sets corresponding to certain varieties of finite monoids, J. Pure and Applied Algebra, 15, (1979), 319–327.
D. Thérien, Sur les monoïdes dont tous les groupes sont résolubles, Semigroup Forum 26, (1983), 89–101.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pin, J.E. (1985). Finite group topology and p-adic topology for free monoids. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015770
Download citation
DOI: https://doi.org/10.1007/BFb0015770
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15650-5
Online ISBN: 978-3-540-39557-7
eBook Packages: Springer Book Archive