Factor complexity
From MaRDI portal
Publication:5393498
DOI10.1017/CBO9780511777653.005zbMath1216.68204OpenAlexW2247002827MaRDI QIDQ5393498
François Nicolas, Julien Cassaigne
Publication date: 18 April 2011
Published in: Combinatorics, Automata and Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/cbo9780511777653.005
Related Items (27)
Subshifts with slow complexity and simple groups with the Liouville property ⋮ -adic characterization of minimal ternary dendric shifts ⋮ Aperiodic SFTs on Baumslag-Solitar groups ⋮ Subword Complexity and Decomposition of the Set of Factors ⋮ Minimal complexity of equidistributed infinite permutations ⋮ 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 ⋮ Infinite interval exchange transformations from shifts ⋮ A characterization of words of linear complexity ⋮ Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm ⋮ S-adic Sequences: A Bridge Between Dynamics, Arithmetic, and Geometry ⋮ An algorithm for enumerating all infinite repetitions in a D0L-system ⋮ Topological full groups of minimal subshifts with subgroups of intermediate growth ⋮ On the zero defect conjecture ⋮ Symbol ratio minimax sequences in the lexicographic order ⋮ A characterization of Sturmian sequences by indistinguishable asymptotic pairs ⋮ Growth of étale groupoids and simple algebras ⋮ Coding Non-orientable Laminations ⋮ On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited ⋮ Spectral continuity for aperiodic quantum systems: Applications of a folklore theorem ⋮ Complexity and fractal dimensions for infinite sequences with positive entropy ⋮ Eventually dendric shift spaces ⋮ Markov partitions for toral \(\mathbb{Z}^2\)-rotations featuring Jeandel-Rao Wang shift and model sets ⋮ Almost everywhere balanced sequences of complexity \(2n + 1\) ⋮ Lamination languages
This page was built for publication: Factor complexity
