Growth rate of binary words avoiding \(xxx^{R}\)
From MaRDI portal
Publication:897919
DOI10.1016/j.tcs.2015.11.004zbMath1334.68170arXiv1502.07014OpenAlexW1896187825MaRDI QIDQ897919
Narad Rampersad, James D. Currie
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.07014
Related Items
On the aperiodic avoidability of binary patterns with variables and reversals, Avoidance bases for formulas with reversal, Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability, A family of formulas with reversal of high avoidability index, Relations on words, Formulas with reversal, Avoidability index for binary patterns with reversal
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Growth problems for avoidable words
- Sequences with subword complexity \(2n\)
- On the number of Abelian square-free words on four letters
- Uniformly growing k-th power-free homomorphisms
- Pattern Avoidability with Involution
- UNARY PATTERNS WITH INVOLUTION
- Growth Properties of Power-Free Languages
- On a Special Functional Equation