Fine and Wilf’s Theorem and Pseudo-repetitions
From MaRDI portal
Publication:2912765
DOI10.1007/978-3-642-32589-2_58zbMath1365.68363OpenAlexW1654870670MaRDI QIDQ2912765
Florin Manea, Robert Mercaş, Dirk Nowotka
Publication date: 25 September 2012
Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_58
Related Items (7)
Hide and seek with repetitions ⋮ Equations enforcing repetitions under permutations ⋮ Embedding a \(\theta \)-invariant code into a complete one ⋮ The extended equation of Lyndon and Schützenberger ⋮ Pseudo-solutions of word equations ⋮ A periodicity lemma for partial words ⋮ Cubic patterns with permutations
This page was built for publication: Fine and Wilf’s Theorem and Pseudo-repetitions
