This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Y. CESARI-Sur un algorithme donnant les codes bipréfixes finis, Mat. Syst. Theory, 6, 3, 1972, 221–225.
A.H. CLIFFORD, G.B. PRESTON-The Algebraic Theory of Semigroups, Vol.1, Amer. Math. Soc, 1961.
S. EILENBERG-Automata, Languages and Machines, Vol. A, Academic Press (1974)
D. PERRIN-Codes Bipréfixes et Groupes de Permutations, Thèse, Paris (1975)
D. PERRIN-La Transitivité du groupe d’un Code bipréfixe fini, (à paraître dans Math. Zeitschrift).
J.F. PERROT-Groupes de permutations associés aux codes préfixes finis, in Permutations, Gauthier-Villars, Paris, 1972.
M.P. SCHUTZENBERGER-On a special class of recurrent events, Annals of Math. Stat, 32, 1961, 1201–1213.
M.P. SCHUTZENBERGER-On a family of submonoids, Publ. Math. Inst. Hungarian. Acad. Sci. VI, A, 3, 1961.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer-Verlag
About this paper
Cite this paper
Perrin, D. (1977). La representation ergodique des codes biprefixes. In: Malliavin, M.P. (eds) Séminaire d’Algèbre Paul Dubreil Paris 1975–1976 (29ème Année). Lecture Notes in Mathematics, vol 586. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0087131
Download citation
DOI: https://doi.org/10.1007/BFb0087131
Received:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08243-9
Online ISBN: 978-3-540-37369-8
eBook Packages: Springer Book Archive
