Minimal Complexities for Infinite Words Written with d Letters
From MaRDI portal
Publication:6134858
Cites work
- scientific article; zbMATH DE number 3871492 (Why is no real title available?)
- scientific article; zbMATH DE number 3880825 (Why is no real title available?)
- scientific article; zbMATH DE number 3991618 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1503600 (Why is no real title available?)
- scientific article; zbMATH DE number 2229974 (Why is no real title available?)
- A Rauzy fractal unbounded in all directions of the plane
- A set of sequences of complexity \(2n+1\)
- A unique ergodicity of minimal symbolic flows with linear block growth
- Abelian combinatorics on words: a survey
- Abelian complexity and abelian co-decomposition
- Abelian complexity and frequencies of letters in infinite words
- Abelian complexity and synchronization
- Abelian complexity function of the Tribonacci word
- Abelian complexity of fixed point of morphism \(0 \mapsto 012, 1 \mapsto 02, 2 \mapsto 1\)
- Abelian complexity of infinite words associated with quadratic Parry numbers
- Abelian complexity of minimal subshifts
- Asymptotic abelian complexities of certain morphic binary words
- Balance and abelian complexity of the Tribonacci word
- Beyond substitutive dynamical systems: \(S\)-adic expansions
- Billiard complexity in rational polyhedra
- Classification of rotations on the torus \(\mathbb T^2\)
- Combinatoire de mots récurrents de complexitén+2
- Complexity and growth for polygonal billiards
- Complexity of Degenerated Three Dimensional Billiard Words
- Complexity of sequences defined by billiard in the cube
- Complexity of trajectories in rectangular billiards
- Computing abelian complexity of binary uniform morphic words
- Directional complexity of the hypercubic billiard
- Dynamical Systems Around the Rauzy Gasket and Their Ergodic Properties
- Episturmian words and episturmian morphisms
- Episturmian words: a survey
- Ergodic theory of interval exchange maps
- Multidimensional Euclidean algorithms, numeration and substitutions
- Nivat's conjecture and pattern complexity in algebraic subshifts
- Nonexpansive \(\mathbb{Z}^{2}\)-subdynamics and Nivat's conjecture
- On a conjecture on bidimensional words.
- On the abelian complexity of generalized Thue-Morse sequences
- On the abelian complexity of the Rudin-Shapiro sequence
- On the asymptotic abelian complexity of morphic words
- On the minimal complexity of infinite words
- Periodicity and local complexity
- Rauzy's conjecture on billiards in the cube
- Recurrent words with constant abelian complexity
- Représentation géométrique de suites de complexité $2n+1$
- Sequences with minimal block growth
- Symbolic Dynamics II. Sturmian Trajectories
- The abelian complexity of infinite words and the Frobenius problem
- The abelian complexity of the paperfolding word
- The rectangle complexity of functions on two-dimensional lattices
- Ultimately constant abelian complexity of infinite words
Cited in
(3)
This page was built for publication: Minimal Complexities for Infinite Words Written with d Letters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134858)