Pages that link to "Item:Q4716073"
From MaRDI portal
The following pages link to Reconnaissabilité des substitutions et complexité des suites automatiques (Q4716073):
Displayed 50 items.
- On factors of synchronized sequences (Q410714) (← links)
- Topological conjugacy of constant length substitution dynamical systems (Q505048) (← links)
- The complexity of Fibonacci-like kneading sequences (Q557842) (← links)
- Subword complexity of uniform D0L words over finite groups (Q719314) (← links)
- Coloring factors of substitutive infinite words (Q729779) (← links)
- On the joint subword complexity of automatic sequences (Q837149) (← links)
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- Unimodular Pisot substitutions and their associated tiles (Q873844) (← links)
- On the permutation complexity of the Cantor-like sequences (Q906402) (← links)
- On the triplex substitution -- combinatorial properties (Q943630) (← links)
- Asymptotic subword complexity of fixed points of group substitutions (Q1019186) (← links)
- Geometry of the common dynamics of flipped Pisot substitutions (Q1022356) (← links)
- Arithmetic and dynamical properties of the Rauzy fractal (Q1273185) (← links)
- Measure-theoretic complexity of ergodic systems (Q1366949) (← links)
- Separators in infinite words generated by morphisms. (Q1390860) (← links)
- The ring of \(k\)-regular sequences. II. (Q1426034) (← links)
- Realtime subshifts (Q1566732) (← links)
- Prefix-suffix automaton associated with a primitive substitution (Q1606160) (← links)
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution (Q1606161) (← links)
- Self-induced systems (Q1661526) (← links)
- Palindrome complexity. (Q1853729) (← links)
- Formulas for complexity, invariant measure and RQA characteristics of the period-doubling subshift (Q2205419) (← links)
- Topological conjugacy to given constant length substitution minimal systems (Q2252937) (← links)
- Characterization of circular D0L-systems (Q2272391) (← links)
- On the complexity of infinite words generated by countable \(q\)-automata (Q2372782) (← links)
- Palindromic length of words and morphisms in class \(\mathcal{P}\) (Q2420618) (← links)
- Balancedness and coboundaries in symbolic systems (Q2422021) (← links)
- On the subword complexity of Thue-Morse polynomial extractions (Q2465648) (← links)
- Symmetrized \(\beta \)-integers (Q2474235) (← links)
- Multidimensional constant-length substitution sequences (Q2566256) (← links)
- Geometric representation of substitutions of Pisot type (Q2750938) (← links)
- On automorphism groups of low complexity subshifts (Q2793099) (← links)
- Coding of substitution dynamical systems as shifts of finite type (Q2805069) (← links)
- On the D0L Repetition Threshold (Q3060199) (← links)
- Sommes de Birkhoff itérées sur des extensions finies d'odomètres. Construction de solutions auto-similaires à des équations différentielles avec délai (Q4557518) (← links)
- Bounded topological speedups (Q4641470) (← links)
- Spectral theory of substitutions (Q4643284) (← links)
- Rigidity and Substitutive Dendric Words (Q4683228) (← links)
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES (Q4902892) (← links)
- Birkhoff sum fluctuations in substitution dynamical systems (Q4968748) (← links)
- The subword complexity of fixed points of binary uniform morphisms (Q5055933) (← links)
- (Q5109958) (← links)
- On winning shifts of marked uniform substitutions (Q5223831) (← links)
- Recognizability for sequences of morphisms (Q5235114) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5918904) (← links)
- Extended symmetry groups of multidimensional subshifts with hierarchical structure (Q5918928) (← links)
- Recognizability of morphisms (Q6068415) (← links)
- Decidable problems in substitution shifts (Q6126479) (← links)
- Automaticity and Parikh-Collinear Morphisms (Q6134878) (← links)
- Conjugacy of unimodular Pisot substitution subshifts to domain exchanges (Q6191451) (← links)