Eulerian entropy and non-repetitive subword complexity

dc.contributor.author Moothathu, T. K.Subrahmonian
dc.date.accessioned 2022-03-27T04:08:09Z
dc.date.available 2022-03-27T04:08:09Z
dc.date.issued 2012-02-24
dc.description.abstract We consider continuous self-maps of compact metric spaces, and for each point of the space we define the notion of eulerian entropy by considering the exponential growth rate of complexity in the initial chunks of the orbit of the point. We show that eulerian entropy is constant on a residual subset for transitive dynamical systems. For elements in the shift dynamical system we define an equivalent notion named non-repetitive subword complexity, and show that for a large class of mixing subshifts of finite type, the set of points for which the non-repetitive subword complexity is equal to the topological entropy is residual. If f is either a transitive interval map or an infinite transitive subshift of finite type, we establish that there is t∈N such that the eulerian entropy of ft is a positive constant that is attained on a residual set of points. © 2011 Elsevier B.V. All rights reserved.
dc.identifier.citation Theoretical Computer Science. v.420
dc.identifier.issn 03043975
dc.identifier.uri 10.1016/j.tcs.2011.11.013
dc.identifier.uri https://www.sciencedirect.com/science/article/abs/pii/S0304397511009327
dc.identifier.uri https://dspace.uohyd.ac.in/handle/1/6360
dc.subject de Bruijn sequence
dc.subject Eulerian path
dc.subject Subshift of finite type
dc.subject Subword complexity
dc.subject Topological entropy
dc.subject Transitivity
dc.title Eulerian entropy and non-repetitive subword complexity
dc.type Journal. Article
dspace.entity.type
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: