A note on short palindromes in square-free words
From MaRDI portal
Publication:476919
DOI10.1016/J.TCS.2014.10.040zbMATH Open1304.68144OpenAlexW1970741915MaRDI QIDQ476919FDOQ476919
Authors: Mike Müller, Tero Harju
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.040
Recommendations
- Palindrome positions in ternary square-free words
- A note on palindromicity
- A note on square-free shuffles of words
- On the least number of palindromes in two-dimensional words
- On palindromic factorization of words
- Palindromic subsequences in finite words
- On the least number of palindromes contained in an infinite word
- On highly palindromic words: the \(n\)-ary case
- scientific article; zbMATH DE number 3894492
- On shuffled-square-free words
Cites Work
Cited In (3)
This page was built for publication: A note on short palindromes in square-free words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476919)