Factorizing the polynomial of a code
HTML articles powered by AMS MathViewer
- by G. Hansel, D. Perrin and C. Reutenauer PDF
- Trans. Amer. Math. Soc. 285 (1984), 91-105 Request permission
Abstract:
We give an extension and a simplified presentation of a theorem of Schützenberger. This theorem describes the factorization of the commutative polynomial associated with a finite maximal code. It is the deepest result known so far in the theory of (variable-length) codes.References
- Samuel Eilenberg, Automata, languages, and machines. Vol. A, Pure and Applied Mathematics, Vol. 58, Academic Press [Harcourt Brace Jovanovich, Publishers], New York, 1974. MR 0530382
- G. Hansel and D. Perrin, Codes and Bernoulli partitions, Math. Systems Theory 16 (1983), no. 2, 133–157. MR 696142, DOI 10.1007/BF01744574
- Gérard Lallement, Semigroups and combinatorial applications, Pure and Applied Mathematics, John Wiley & Sons, New York-Chichester-Brisbane, 1979. MR 530552
- Marcel-Paul Schützenberger, Sur certains sous-monoïdes libres, Bull. Soc. Math. France 93 (1965), 209–223 (French). MR 190253
Additional Information
- © Copyright 1984 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 285 (1984), 91-105
- MSC: Primary 20M35; Secondary 16A06, 94B45
- DOI: https://doi.org/10.1090/S0002-9947-1984-0748832-X
- MathSciNet review: 748832