Displaying similar documents to “Pattern avoidance in partial words over a ternary alphabet”

The entropy of Łukasiewicz-languages

Ludwig Staiger (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

The paper presents an elementary approach for the calculation of the entropy of a class of languages. This approach is based on the consideration of roots of a real polynomial and is also suitable for calculating the Bernoulli measure. The class of languages we consider here is a generalisation of the Łukasiewicz language.

The entropy of Łukasiewicz-languages

Ludwig Staiger (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

The paper presents an elementary approach for the calculation of the entropy of a class of languages. This approach is based on the consideration of roots of a real polynomial and is also suitable for calculating the Bernoulli measure. The class of languages we consider here is a generalisation of the Łukasiewicz language.

On the growth rates of complexity of threshold languages

Arseny M. Shur, Irina A. Gorbunova (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Threshold languages, which are the (/(–1))-free languages over -letter alphabets with ≥ 5, are the minimal infinite power-free languages according to Dejean's conjecture, which is now proved for all alphabets. We study the growth properties of these languages. On the base of obtained structural properties and computer-assisted studies we conjecture that the growth rate of complexity of the threshold language over letters tends to a constant α ^ ≈ 1 . 242 as tends to infinity.

A new approach to mutual information

Fumio Hiai, Dénes Petz (2007)

Banach Center Publications

Similarity:

A new expression as a certain asymptotic limit via "discrete micro-states" of permutations is provided for the mutual information of both continuous and discrete random variables.

A new approach to mutual information. II

Fumio Hiai, Takuho Miyamoto (2010)

Banach Center Publications

Similarity:

A new concept of mutual pressure is introduced for potential functions on both continuous and discrete compound spaces via discrete micro-states of permutations, and its relations with the usual pressure and the mutual information are established. This paper is a continuation of the paper of Hiai and Petz in Banach Center Publications, Vol. 78.

The entropy conjecture for diffeomorphisms away from tangencies

Gang Liao, Marcelo Viana, Jiagang Yang (2013)

Journal of the European Mathematical Society

Similarity:

We prove that every C 1 diffeomorphism away from homoclinic tangencies is entropy expansive, with locally uniform expansivity constant. Consequently, such diffeomorphisms satisfy Shub’s entropy conjecture: the entropy is bounded from below by the spectral radius in homology. Moreover, they admit principal symbolic extensions, and the topological entropy and metrical entropy vary continuously with the map. In contrast, generic diffeomorphisms with persistent tangencies are not entropy expansive. ...