Let A be a finite, totally ordered alphabet, and let P be the lexicographic ordering on A\*. Let X be a subset of A\*. The language of minimal words of X is the subset of X composed of the lexicographically minimal word of X for each length: The aim of this paper is to prove that if L is a context-
β¦ LIBER β¦
The shuffle algebra on the factors of a word is free
β Scribed by Christophe Reutenauer
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 463 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The Set of Minimal Words of a Context-fr
β
Jean Berstel; L. Boasson
π
Article
π
1997
π
Elsevier Science
π
English
β 360 KB
On the Algebra of a Free Inverse Monoid
β
M.J. Crabb; W.D. Munn
π
Article
π
1996
π
Elsevier Science
π
English
β 138 KB
The Algebra of Quasi-Symmetric Functions
β
Michiel Hazewinkel
π
Article
π
2001
π
Elsevier Science
π
English
β 144 KB
Let Z denote the Leibniz-Hopf algebra, which also turns up as the Solomon descent algebra and the algebra of noncommutative symmetric functions. As an algebra Z=ZOZ 1 , Z 2 , ...P, the free associative algebra over the integers in countably many indeterminates. The coalgebra structure is given by m(
On bispecial factors of the ThueβMorse w
β
Aldo de Luca; Licia Mione
π
Article
π
1994
π
Elsevier Science
π
English
β 406 KB
A remark on extensions of quasi-free der
β
Ola Bratteli
π
Article
π
1982
π
Springer
π
English
β 288 KB
On the structure of free baxter algebras
β
P Cartier
π
Article
π
1972
π
Elsevier Science
π
English
β 580 KB