Please use this identifier to cite or link to this item:
|Title:||Branching densities of cube-free and square-free words|
|Authors:||Petrova, E. A.|
Shur, A. M.
|Citation:||Petrova E. A. Branching densities of cube-free and square-free words / E. A. Petrova, A. M. Shur. — DOI 10.3390/a14040126 // Algorithms. — 2021. — Vol. 14. — Iss. 4. — 126.|
|Abstract:||Binary cube-free language and ternary square-free language are two “canonical” represen-tatives of a wide class of languages defined by avoidance properties. Each of these two languages can be viewed as an infinite binary tree reflecting the prefix order of its elements. We study how “homogenious” these trees are, analysing the following parameter: the density of branching nodes along infinite paths. We present combinatorial results and an efficient search algorithm, which together allowed us to get the following numerical results for the cube-free language: the minimal density of branching points is between 3509/9120 ≈ 0.38476 and 13/29 ≈ 0.44828, and the maximal density is between 0.72 and 67/93 ≈ 0.72043. We also prove the lower bound 223/868 ≈ 0.25691 on the density of branching points in the tree of the ternary square-free language. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.|
|metadata.dc.description.sponsorship:||This research was funded by Ministry of Science and Higher Education of the Russian Federation (Ural Mathematical Center project No. 075-02-2020-1537/1).|
|Appears in Collections:||Научные публикации, проиндексированные в SCOPUS и WoS CC|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.