We define an infinite class of fractals, called horizontally and vertically blocked labyrinth fractals, which are dendrites and special Sierpiński carpets. Between any two points in the fractal there is a unique arc a; the length of a is infinite and the set of points where no tangent to a exists is dense in a.

No abstract

We investigate the visibility parameter, i.e., the number of visible pairs, first for words over a finite alphabet, then for permutations of the finite set {1 2 }, and finally for words over an infinite alphabet whose letters occur with geometric probabilities. The results obtained for permutations correct the formula for the expectation obtained in a recent paper by Gutin et al. [Gutin G., Mansour T., Severini S., A characterization of horizontal visibility graphs and combinatorics on words, Phys. A, 2011, 390(12), 2421-2428], and for words over a finite alphabet the formula obtained in the present paper for the expectation is more precise than that obtained in the cited paper. More importantly, we also compute the variance for each case. MSC:05A05, 05A30