Transition Property for Cube-Free Words
Sign Up to like & getrecommendations! Published in 2020 at "Theory of Computing Systems"
DOI: 10.1007/s00224-020-09979-4
Abstract: We study cube-free words over arbitrary non-unary finite alphabets and prove the following structural property: for every pair ( u , v ) of d -ary cube-free words, if u can be infinitely extended to… read more here.
Keywords: transition property; cube free; free words;