Avoidability of circular formulas
From MaRDI portal
Publication:1743715
DOI10.1016/j.tcs.2017.11.014zbMath1393.68142arXiv1610.04439OpenAlexW2535670093MaRDI QIDQ1743715
Gwenaël Richomme, Pascal Ochem, Guilhem Gamard, Patrice Séébold
Publication date: 16 April 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.04439
Related Items (9)
Avoidance bases for formulas with reversal ⋮ Lie complexity of words ⋮ The undirected repetition threshold and undirected pattern avoidance ⋮ A family of formulas with reversal of arbitrarily high avoidability index ⋮ Avoidability of formulas with two variables ⋮ Avoiding or Limiting Regularities in Words ⋮ Avoidability of palindrome patterns ⋮ Avoiding conjugacy classes on the 5-letter alphabet ⋮ On some interesting ternary formulas
Cites Work
- Unnamed Item
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- Growth problems for avoidable words
- Avoidable patterns in strings of symbols
- Avoidability of formulas with two variables
- Doubled patterns are 3-avoidable
- Avoiding Patterns in the Abelian Sense
- A generator of morphisms for infinite words
- BLOCKING SETS OF TERMS
This page was built for publication: Avoidability of circular formulas
