Behavior of various complexity functions
From MaRDI portal
Recommendations
- Factor complexity
- Three complexity functions
- On the complexity of infinite sequences
- On maximal pattern complexity of some automatic words
- Modified complexity and *-Sturmian word
- Drunken man infinite words complexity
- scientific article; zbMATH DE number 1992419
- Automata calculating the complexity of automatic sequences
- scientific article; zbMATH DE number 1992418
- Complexity of infinite sequences with zero entropy
Cites work
- Combinatorial lemmas and applications to dynamics
- Language structure of pattern Sturmian words
- Maximal pattern complexity for discrete systems
- Maximal pattern complexity of two-dimensional words
- Maximal pattern complexity of words over \(\ell\) letters
- Maximal pattern complexity, dual system and pattern recognition
- On maximal pattern complexity of some automatic words
- Partitions by congruent sets and optimal positions
- Sequence entropy and the maximal pattern complexity of infinite words
- Substitutions in dynamics, arithmetics and combinatorics
- Super-stationary set, subword problem and the complexity
- Three complexity functions
- Uniform sets and complexity
- Uniform sets and super-stationary sets over general alphabets
Cited in
(8)- Complexity of leading digit sequences
- scientific article; zbMATH DE number 1124602 (Why is no real title available?)
- scientific article; zbMATH DE number 1979755 (Why is no real title available?)
- Maximal pattern complexity, dual system and pattern recognition
- Super-stationary set, subword problem and the complexity
- Uniform sets and complexity
- Three complexity functions
- Central sets generated by uniformly recurrent words
This page was built for publication: Behavior of various complexity functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764361)
