Resumen
Binary cube-free language and ternary square-free language are two ?canonical? representatives 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
3509
/
9120
?
0.38476
and 13/29?0.44828
13
/
29
?
0.44828
, and the maximal density is between 0.72
0.72
and 67/93?0.72043
67
/
93
?
0.72043
. We also prove the lower bound 223/868?0.25691
223
/
868
?
0.25691
on the density of branching points in the tree of the ternary square-free language.