Entropy for symbolic dynamics with overlapping alphabets

From MaRDI portal
Publication:300352

DOI10.1007/S10884-016-9535-5zbMATH Open1366.37022arXiv1011.3402OpenAlexW1628844149MaRDI QIDQ300352FDOQ300352


Authors: Fabio Drucker, David S. Richeson, Jim Wiseman Edit this on Wikidata


Publication date: 27 June 2016

Published in: Journal of Dynamics and Differential Equations (Search for Journal in Brave)

Abstract: 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 neighborhoods, the entropy gives a lower bound for the topological entropy of the dynamical system.


Full work available at URL: https://arxiv.org/abs/1011.3402




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Entropy for symbolic dynamics with overlapping alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300352)