Avoiding square-free words on free groups
From MaRDI portal
Publication:2672587
DOI10.1016/j.tcs.2022.04.025OpenAlexW3155407717MaRDI QIDQ2672587
Golnaz Badkobeh, Matthieu Rosenfeld, Pascal Ochem, Tero J.Harju
Publication date: 13 June 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.06837
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Growth problems for avoidable words
- Growth rates of complexity of power-free languages
- Sharp characterizations of squarefree morphisms
- Subword complexity and power avoidance
- A generator of morphisms for infinite words
- Comparing Complexity Functions of a Language and Its Extendable Part
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- Automatic Sequences
- Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters
- A Sequence Without Repeats on x, x -1 , y, y -1
- Transition property for cube-free words
This page was built for publication: Avoiding square-free words on free groups