Square-free words on partially commutative free monoids
From MaRDI portal
Publication:1076163
DOI10.1016/0020-0190(86)90056-6zbMath0593.20065OpenAlexW1976087609MaRDI QIDQ1076163
Publication date: 1986
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(86)90056-6
Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
A decision procedure on partially commutative free monoids ⋮ Theory of traces ⋮ Non-repetitive words relative to a rewriting system ⋮ On the number of partially abelian square-free words on a three-letter alphabet ⋮ Growth of repetition-free words -- a review ⋮ Partially abelian squarefree words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp characterizations of squarefree morphisms
- Combinatorial problems of commutation and rearrangements
- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
- A Sequence Without Repeats on x, x -1 , y, y -1