Eulerian entropy and non-repetitive subword complexity

DOI10.1016/J.TCS.2011.11.013zbMATH Open1246.68177OpenAlexW2074660542MaRDI QIDQ764367FDOQ764367

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

Recommendations

• Entropy of dynamical systems with repetition property
• scientific article
• Measure-theoretic complexity of ergodic systems
• Entropy of nonautonomous dynamical systems
• Algorithmic complexity of points in dynamical systems

zbMATH Keywords

de Bruijn sequencetransitivitytopological entropyEulerian pathsubshift of finite typesubword complexity

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

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

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)