Pages that link to "Item:Q3217626"
From MaRDI portal
The following pages link to Complexité des facteurs des mots infinis engendrés par morphismes itérés (Q3217626):
Displaying 50 items.
- New second-preimage attacks on hash functions (Q321303) (← links)
- Relations on words (Q505060) (← links)
- The complexity of Fibonacci-like kneading sequences (Q557842) (← links)
- Some improvements of the \(S\)-adic conjecture (Q651048) (← links)
- Subword complexity of uniform D0L words over finite groups (Q719314) (← links)
- On the complexity of a family of \(k\)-context-free sequences (Q764304) (← links)
- On the joint subword complexity of automatic sequences (Q837149) (← links)
- On complexity functions of infinite words associated with generalized Dyck languages (Q954986) (← links)
- Asymptotic subword complexity of fixed points of group substitutions (Q1019186) (← links)
- Every iterated morphism yields a co-CFL (Q1069710) (← links)
- On recognizable sets of integers (Q1273179) (← links)
- Toeplitz words, generalized periodicity and periodically iterated morphisms (Q1362993) (← links)
- Transcendence of numbers with a low complexity expansion (Q1377590) (← links)
- Separators in infinite words generated by morphisms. (Q1390860) (← links)
- On the computational complexity of infinite words. (Q1401236) (← links)
- Balances for fixed points of primitive substitutions. (Q1426036) (← links)
- Generalization of automatic sequences for numeration systems on a regular language (Q1575724) (← links)
- Palindrome complexity. (Q1853729) (← links)
- Automatic sequences based on Parry or Bertrand numeration systems (Q2002037) (← links)
- Spectral properties of Schrödinger operators associated with almost minimal substitution systems (Q2025608) (← links)
- Logarithmic equal-letter runs for BWT of purely morphic words (Q2163991) (← links)
- Some remarks about stabilizers (Q2271432) (← links)
- On the complexity of infinite words generated by countable \(q\)-automata (Q2372782) (← links)
- Syndeticity and independent substitutions (Q2377960) (← links)
- On the asymptotic abelian complexity of morphic words (Q2406541) (← links)
- A simple approach to minimal substitution subshifts (Q2415957) (← links)
- On a class of infinite words with affine factor complexity (Q2465623) (← links)
- On the subword complexity of Thue-Morse polynomial extractions (Q2465648) (← links)
- Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts (Q2474222) (← links)
- Periodicity of morphic words (Q2515198) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- On almost periodicity of morphic sequences (Q2631211) (← links)
- The automorphism group of a shift of subquadratic growth (Q2789860) (← links)
- On automorphism groups of low complexity subshifts (Q2793099) (← links)
- Abelian complexity and frequencies of letters in infinite words (Q2833546) (← links)
- Subword Complexity and Decomposition of the Set of Factors (Q2922010) (← links)
- Free ergodic ℤ²-systems and complexity (Q2951156) (← links)
- Les premiers recursivement inaccessible et Mahlo et la theorie des dilatateurs (Q3220581) (← links)
- Invariant measures for Cantor dynamical systems (Q3296002) (← links)
- Cost and dimension of words of zero topological entropy (Q3299253) (← links)
- Drunken man infinite words complexity (Q3526419) (← links)
- Invariant measures on stationary Bratteli diagrams (Q3583782) (← links)
- Infinite interval exchange transformations from shifts (Q4600266) (← links)
- General Framework (Q4613545) (← links)
- On periodically iterated morphisms (Q4635624) (← links)
- On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited (Q4960229) (← links)
- Two infinite words with cubic subword complexity (Q5132212) (← links)
- A characterization of words of linear complexity (Q5384833) (← links)
- ON THE TRANSITION SEMIGROUPS OF CENTRALLY LABELED RAUZY GRAPHS (Q5389117) (← links)
- SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS (Q5483459) (← links)
