We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of entropies of (standard) full shifts. When a shift space with overlaps arises as a model for a discrete dynamical system with a finite set of overlapping neighborho...

MOTIVATION Topological entropy has been one of the most difficult to implement of all the entropy-theoretic notions. This is primarily due to finite sample effects and high-dimensionality problems. In particular, topological entropy has been implemented in previous literature to conclude that entropy of exons is higher than of introns, thus implying that exons are more 'random' than introns. ...

This paper addresses the problem of determining the distance between two regular languages. It will show how to expand Jaccard distance, which works on finite sets, to potentially-infinite regular languages. The entropy of a regular language plays a large role in the extension. Much of the paper is spent investigating the entropy of a regular language. This includes addressing issues that have ...

We study dynamical systems given by the action $T: G \times X \to X$ of a finitely generated semigroup $G$ with identity $1$ on compact metric space $X$ continuous selfmaps and $T(1,-)={\rm id} _X$. For any finite generating set

We give a “limit-free formula” simplifying the computation of the topological entropy for topological automorphisms of totally disconnected locally compact groups. This result allows us to extend to our setting several basic properties of the topological entropy known for compact groups.

In the real world, we are confronted not only with complex and high-dimensional data sets, but usually with noisy, incomplete and uncertain data, where the application of traditional methods of knowledge discovery and data mining always entail the danger of modeling artifacts. Originally, information entropy was introduced by Shannon (1949), as a measure of uncertainty in the data. But up to th...

We construct two equivalent smooth flows, one of which has positive topological entropy and the other has zero topological entropy. This provides a negative answer to a problem posed by Ohno.

This paper deals with the relationship between the periodic orbits of continuous maps on graphs and the topological entropy of the map. We show that the topological entropy of a graph map can be approximated by the entropy of its periodic orbits.