Constructing Premaximal Ternary Square-Free Words of Any Level
From MaRDI portal
Publication:2912773
DOI10.1007/978-3-642-32589-2_65zbMath1365.68364OpenAlexW2280268851MaRDI QIDQ2912773
Elena A. Petrova, Arseny M. Shur
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_65
Related Items (5)
On the Tree of Ternary Square-Free Words ⋮ Square-Free Partial Words with Many Wildcards ⋮ Transition property for cube-free words ⋮ Ternary Square-Free Partial Words with Many Wildcards ⋮ Subword complexity and power avoidance
This page was built for publication: Constructing Premaximal Ternary Square-Free Words of Any Level
