Cargando…
Subshifts on Infinite Alphabets and Their Entropy
We analyze symbolic dynamics to infinite alphabets by endowing the alphabet with the cofinite topology. The topological entropy is shown to be equal to the supremum of the growth rate of the complexity function with respect to finite subalphabets. For the case of topological Markov chains induced by...
Autor principal: | Rezagholi, Sharwin |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7712269/ https://www.ncbi.nlm.nih.gov/pubmed/33287061 http://dx.doi.org/10.3390/e22111293 |
Ejemplares similares
-
Normal Laws for Two Entropy Estimators on Infinite Alphabets
por: Chen, Chen, et al.
Publicado: (2018) -
Wap systems and labeled subshifts
por: Akin, Ethan, et al.
Publicado: (2019) -
Finitary measures for subshifts of finite type and sofic systems
por: Kitchens, Bruce, et al.
Publicado: (1985) -
On the Correspondence between Subshifts of Finite Type and Statistical Mechanics Models
por: Corona, Luis Armando, et al.
Publicado: (2022) -
Entropy exchange for infinite-dimensional systems
por: Duan, Zhoubo, et al.
Publicado: (2017)