On the aperiodic avoidability of binary patterns with variables and reversals
From MaRDI portal
Publication:2358690
DOI10.1016/j.tcs.2016.12.022zbMath1373.68305OpenAlexW2567204204MaRDI QIDQ2358690
Publication date: 15 June 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/On_the_aperiodic_avoidability_of_binary_patterns_with_variables_and_reversals/9402257
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Avoidability index for binary patterns with reversal
- On the least number of palindromes contained in an infinite word
- Computing the partial word avoidability indices of binary patterns
- Avoiding large squares in infinite binary words
- Avoidable binary patterns in partial words
- Growth rate of binary words avoiding \(xxx^{R}\)
- A generalization of Thue freeness for partial words
- Avoidable patterns on two letters
- Avoidable patterns in strings of symbols
- Every binary pattern of length six is avoidable on the two-letter alphabet
- Unavoidable binary patterns
- How many squares must a binary sequence contain?
- On the aperiodic avoidability of binary patterns with variables and reversals
- Freeness of partial words
- UNARY PATTERNS WITH INVOLUTION
- Binary patterns in binary cube-free words: Avoidability and growth
- The Avoidability of Cubes under Permutations
- A generator of morphisms for infinite words
- Unary Patterns with Permutations
- Binary words avoiding xx^Rx and strongly unimodal sequences
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
- BLOCKING SETS OF TERMS
- INNER PALINDROMIC CLOSURE