Eulerian entropy and non-repetitive subword complexity

DOI10.1016/J.TCS.2011.11.013MaRDI QIDQ764367zbMATH OpenOpenAlexFDO

Authors T. K. Subrahmonian Moothathu

Publication date 13 March 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2011.11.013

zbMATH Keywords

de Bruijn sequencetransitivitytopological entropyEulerian pathsubshift of finite typesubword complexity

Mathematics Subject Classification ID

Topological entropy (37B40) Combinatorics on words (68R15)

Recommendations

• Entropy of dynamical systems with repetition property
• scientific article; zbMATH DE number 3487356
• Measure-theoretic complexity of ergodic systems
• Entropy of nonautonomous dynamical systems
• Algorithmic complexity of points in dynamical systems

Cites work

• scientific article; zbMATH DE number 1714670 (Why is no real title available?)
• scientific article; zbMATH DE number 3745547 (Why is no real title available?)
• scientific article; zbMATH DE number 1121847 (Why is no real title available?)
• scientific article; zbMATH DE number 1444020 (Why is no real title available?)
• AN INTRODUCTION TO QUANTITATIVE POINCARÉ RECURRENCE IN DYNAMICAL SYSTEMS
• Abelian complexity of minimal subshifts
• An Introduction to Symbolic Dynamics and Coding
• Compression of individual sequences via variable-rate coding
• Dynamics in one dimension
• Entropy and Poincaré recurrence from a geometrical viewpoint
• Entropy and data compression schemes
• Entropy of interval maps via permutations
• Entropy theorems along times when \(x\) visits a set
• Fifty years of entropy in dynamics: 1958 -- 2007
• Quantitative views of recurrence and proximality
• Syndetically proximal pairs
• The Kolmogorov complexity of infinite words
• The spectrum of Poincaré recurrence
• When every point is either transitive or periodic
• de Bruijn sequences and de Bruijn graphs for a general language

Cited in

(4)

• Initial non-repetitive complexity of infinite words
• Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents
• On non-repetitive complexity of Arnoux-Rauzy words
• Entropy and finite generators for locally compact subshifts

This page was built for publication: Eulerian entropy and non-repetitive subword complexity

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