Factor complexity
From MaRDI portal
Recommendations
Cited in
(41)- Complexity and special factors
- A characterization of Sturmian sequences by indistinguishable asymptotic pairs
- Markov partitions for toral \(\mathbb{Z}^2\)-rotations featuring Jeandel-Rao Wang shift and model sets
- Almost everywhere balanced sequences of complexity \(2n + 1\)
- Aperiodic SFTs on Baumslag-Solitar groups
- Subshifts with slow complexity and simple groups with the Liouville property
- Growth of étale groupoids and simple algebras
- Coding non-orientable laminations
- Lamination languages
- Three complexity functions
- Subword complexity and decomposition of the set of factors
- Spectral continuity for aperiodic quantum systems: applications of a folklore theorem
- On the complexity of calculating factorials
- Infinite interval exchange transformations from shifts
- Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
- An algorithm for enumerating all infinite repetitions in a D0L-system
- On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited
- Topological full groups of minimal subshifts with subgroups of intermediate growth
- Eventually dendric shift spaces
- -adic characterization of minimal ternary dendric shifts
- S-adic sequences: a bridge between dynamics, arithmetic, and geometry
- On the zero defect conjecture
- Complexity and fractal dimensions for infinite sequences with positive entropy
- A characterization of words of linear complexity
- Symbol ratio minimax sequences in the lexicographic order
- Some properties of morphic images of (eventually) dendric words
- Generalizations of Sturmian sequences associated with \(\boldsymbol{N}\)-continued fraction algorithms
- Bracket words: A generalisation of Sturmian words arising from generalised polynomials
- Order Conditions for Languages
- The number of primitive words of unbounded exponent in the language of an HD0L-system is finite
- Proof of a conjecture of Krawchuk and Rampersad on the cyclic complexity of the Thue-Morse sequence
- New string attractor-based complexities for infinite words
- A Pansiot-type subword complexity theorem for automorphisms of free groups
- The heinis spectrum has non-empty interior
- Morphic sequences: complexity and decidability
- Online string attractors. And their relation to the Lempel-Ziv factorization
- \(\mathcal{S}\)-adic characterization of minimal dendric shifts
- Complexity of infinite words
- Pin classes. II: Small pin classes
- On combinatorial and ergodic properties of certain classes of interval translation mappings
- Behavior of various complexity functions
This page was built for publication: Factor complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5393498)
