Preview
Unable to display preview. Download preview PDF.
Bibliographie
J. Brzozowski, Open Problems about regular languages, in normal Languages Perspectives and Open Problems, R. Book editor, Academic press, New York, 1980.
Y. Cesari, M.Vincent, Une caracterisation des mots périodiques, C.R.Acad. Sci. Paris, 286, A, 1175–1177.
J.P. Duval, Périodes et répétitions des mots du monoide libre, 1979 Theoret. Comp. Sci., 9, 17–26.
S. Eilenberg, Automata Languages and Machines, Vol.b, 1976, Academic Press, New York.
G. Lallement, Semigroups and Combinatorial applications, 1979, Wiley Interscience.
E. LeRest et M. LeRest, Thèse, 1979, Université de Rouen.
E. LeRest, et M. LeRest, Une représentation fidèle des groupes d'un monoide de relations sur un ensemble fini, Semigroup Foum 21, 167–172,1980.
E. LeRest et M. LeRest, Sur le calcul du monoÏde syntaxique d'un sous monoÏde finiment engendré, Semigroup Forum 21, 173–185,1980.
M. Lothaire, Combinatorics on Words, Encyclopedia of Mathematics and its Applications, Vol.17, Addison Wesley, Reading Mass., 1983.
S.W. Margolis, K-transformation semigroups and a Conjecture of Tilson, J.Pure and Appl. Alg., 17 (1980) 313–322.
S.W. Margolis, On the syntactic transformation semigroup of a language generated by a finite biprefix code, Theor. Comp. Sci. 21(1982) 225–230.
S.W. Margolis, J.E. Pin, On Varieties of rational languages and variable length codes II, to appear.
D.Perrin, Theorie des codes, to appear.
J.E. Pin, On varieties of rational languages and variable length codes I, J. Pure and Appl. Alg.(23) 1982, 169–196.
J.E. Pin, Sur le monoÏde syntactique de L lorsque L est un langage fini. Theor. Comp. Sci.
A. Salomaa, Jewels of Formal Language Theory, Computer Science Press, Rockville Maryland, 1981.
M.P. Schutzenberger, Une théorie algébrique du codage, C.R.Acad.Sci.Paris (242)1956, 862–864.
M.P. Schützenberger, A property of finitely generated submonoids, Algebraic Theory of Semigroups, G. Pollack Ed. North Holland (1979) 545–576.
B. Tilson, Depth decomposition theorem. Chap. XI in S. Eilenberg, Automata Languages and Machines, Vol. B. Academic Press, New York, 1976.
B. Tilson, Complexity of semigroups and morphisms, Chap. XII in S. Eilenberg, Automata Languages and Machines, Academic press, New York, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le Rest, E., Margolis, S.W. (1983). On the group complexity of a finite language. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036927
Download citation
DOI: https://doi.org/10.1007/BFb0036927
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive