The shuffle algebra on the factors of a word is free
DOI10.1016/0097-3165(85)90020-2zbMATH Open0565.68074OpenAlexW2007543059MaRDI QIDQ1058862FDOQ1058862
Authors: Christophe Reutenauer
Publication date: 1985
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(85)90020-2
Recommendations
Formal languages and automata (68Q45) Associative rings determined by universal properties (free algebras, coproducts, adjunction of inverses, etc.) (16S10) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
Cited In (7)
- The shuffle algebra and its derivations
- On the support of graph Lie algebras
- Standard Lyndon Bases of Lie Algebras and Enveloping Algebras
- Shuffle factorization is unique
- Continuity in a pathwise sense with respect to the coefficients of solutions of stochastic differential equations
- Shuffle products for multiple zeta values and partial fraction decompositions of zeta-functions of root systems
- ON A PROPERTY OF THE FACTORIZING CODES
This page was built for publication: The shuffle algebra on the factors of a word is free
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058862)