Branching Densities of Cube-Free and Square-Free Words
نویسندگان
چکیده
Binary cube-free language and ternary square-free are two “canonical” representatives of a wide class languages defined by avoidance properties. Each these can be viewed as an infinite binary tree reflecting the prefix order its elements. We study how “homogenious” trees are, analysing following parameter: density branching nodes along paths. present combinatorial results efficient search algorithm, which together allowed us to get numerical for language: minimal points is between 3509/9120≈0.38476 13/29≈0.44828, maximal 0.72 67/93≈0.72043. also prove lower bound 223/868≈0.25691 on in language.
منابع مشابه
Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words
Shallit and Wang studied deterministic automatic complexity of words. They showed that the automatic Hausdorff dimension I(t) of the infinite Thue word satisfies 1/3 ≤ I(t) ≤ 2/3. We improve that result by showing that I(t) ≥ 1/2. For nondeterministic automatic complexity we show I(t) = 1/2. We prove that such complexity AN of a word x of length n satisfies AN (x) ≤ b(n) := bn/2c+ 1. This enabl...
متن کاملSquare-free partial words
We say that a partial word w over an alphabet A is square-free if every factor xx of w such that x and x are compatible is either of the form ⋄a or a⋄ where ⋄ is a hole and a ∈ A. We prove that there exist uncountably many square-free partial words over a ternary alphabet with an infinite number of holes.
متن کاملRich square-free words
A word w is rich if it has |w| + 1 many distinct palindromic factors, including the empty word. A word is square-free if it does not have a factor uu, where u is a non-empty word. Pelantová and Starosta (Discrete Math. 313 (2013)) proved that every infinite rich word contains a square. We will give another proof for that result. Pelantová and Starosta denoted by r(n) the length of a longest ric...
متن کاملSquare-free shuffles of words
Let u v denote the set of all shuffles of the words u and v . It is shown that for each integer n ≥ 3 there exists a square-free ternary word u of length n such that u u contains a square-free word. This property is then shown to also hold for infinite words, i.e., there exists an infinite square-free word u on three letters such that u can be shuffled with itself to produce an infinite square-...
متن کاملSquare-free Words with Square-free Self-shuffles
We answer a question of Harju: For every n > 3 there is a square-free ternary word of length n with a square-free self-shuffle.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2021
ISSN: ['1999-4893']
DOI: https://doi.org/10.3390/a14040126