Three complexity functions

DOI10.1051/ITA/2011126MaRDI QIDQ2911427zbMATH OpenOpenAlexFDO

Authors Sébastien Ferenczi, Pascal Hubert

Publication date 31 August 2012

Published in RAIRO. Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/222069

zbMATH Keywords

complexityinfinite wordssymbolic dynamical systems

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Combinatorics on words (68R15)

Recommendations

• Symbolic analysis of finite words: the complexity function
• Factor complexity
• Complexity of infinite sequences with zero entropy
• On the complexity of infinite sequences
• Behavior of various complexity functions

Cites work

• An Introduction to Symbolic Dynamics and Coding
• Behavior of various complexity functions
• Complexity of sequences and dynamical systems
• scientific article; zbMATH DE number 3775877 (Why is no real title available?)
• Maximal pattern complexity for discrete systems
• Non-ergodic interval exchange transformations
• Patterns in words and languages
• Sequence entropy and the maximal pattern complexity of infinite words
• Sequences with minimal block growth
• Sequences with subword complexity \(2n\)
• Substitutions in dynamics, arithmetics and combinatorics
• Super-stationary set, subword problem and the complexity
• Symbolic Dynamics
• Symbolic Dynamics II. Sturmian Trajectories
• Topological mixing for some residual sets of interval exchange transformations
• Uniform sets and complexity
• Weak mixing for interval exchange transformations and translation flows

Cited in

(5)

• An algorithm for the word entropy
• Symbolic analysis of finite words: the complexity function
• The complexity of tangent words
• Maximal pattern complexity, dual system and pattern recognition
• Behavior of various complexity functions

This page was built for publication: Three complexity functions

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