Eulerian entropy and non-repetitive subword complexity

DOI10.1016/j.tcs.2011.11.013zbMath1246.68177OpenAlexW2074660542MaRDI QIDQ764367

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

subshift of finite typetransitivitytopological entropysubword complexityde Bruijn sequenceEulerian path

Mathematics Subject Classification ID

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

Related Items

Initial non-repetitive complexity of infinite words, On non-repetitive complexity of Arnoux-Rauzy words, Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents

Cites Work

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