Reconnaissabilité des substitutions et complexité des suites automatiques
From MaRDI portal
Publication:4716073
DOI10.24033/bsmf.2283zbMath0855.68072MaRDI QIDQ4716073
Publication date: 19 November 1996
Published in: Bulletin de la Société mathématique de France (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=BSMF_1996__124_2_329_0
Related Items
The complexity of Fibonacci-like kneading sequences, On the joint subword complexity of automatic sequences, On the context-freeness of the set of words containing overlaps, Unimodular Pisot substitutions and their associated tiles, On the triplex substitution -- combinatorial properties, Asymptotic subword complexity of fixed points of group substitutions, Geometry of the common dynamics of flipped Pisot substitutions, Arithmetic and dynamical properties of the Rauzy fractal, Measure-theoretic complexity of ergodic systems, Separators in infinite words generated by morphisms., The ring of \(k\)-regular sequences. II., Realtime subshifts, Prefix-suffix automaton associated with a primitive substitution, Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution, Palindrome complexity., On the complexity of infinite words generated by countable \(q\)-automata, On the subword complexity of Thue-Morse polynomial extractions, Symmetrized \(\beta \)-integers, Multidimensional constant-length substitution sequences, Geometric representation of substitutions of Pisot type
Cites Work
- Substitution dynamical systems - spectral analysis
- The ring of \(k\)-regular sequences
- Power of words and recognizability of fixpoints of a substitution
- On the complexity of infinite sequences
- Valeurs propres des systèmes dynamiques définis par des substitutions de longueur variable
- Suites algébriques, automates et substitutions
- Minimal flows arising from substitutions of non-constant length
