Abstract
We show here that there exists a close connection between the languagetheoretic concept of biprefixity and the classical algebraic concept of semisimplicity. More precisely, the main result is that, under suitable hypothesis, a (variablelength) code is biprefix if and only if its syntactic algebra is semisimple.
This is a preview of subscription content, log in via an 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.
Références
J. Berstel, D. Perrin, M.P. Schützenberger: the theory of codes, to appear.
A.H. Clifford, G.B. Preston: the algebraic theory of semigroups, A.M.S.(61).
S. Eilenberg: automata, languages and machines, vol. A, Acad. Press (1974)
I.N. Herstein: noncommutative rings, Carus mathematical monograph (1969).
G. Lallement: semigroups and combinatorial applications, John Wiley (1979)
C. Reutenauer: séries formelles et algèbres syntactiques, J. Algebra 66, 448–483 (1980).
A. Salomaa, M. Soittola: automata-theoretic aspects of formal power series, Springer Verlag (1977).
M.P. Schützenberger: on the definition of a family of automata, Information and Control 4, 245–270 (1961).
M.P. Schützenberger: on a special class of recurrent events, Annals of Math. Stat. 32, 1201–1213 (1961).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reutenauer, C. (1982). Biprefix codes and semisimple algebras. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012791
Download citation
DOI: https://doi.org/10.1007/BFb0012791
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11576-2
Online ISBN: 978-3-540-39308-5
eBook Packages: Springer Book Archive