Reconnaissabilité des substitutions et complexité des suites automatiques
From MaRDI portal
Publication:4716073
DOI10.24033/BSMF.2283zbMATH Open0855.68072OpenAlexW2523590221MaRDI QIDQ4716073FDOQ4716073
Authors: Brigitte Mossé 
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
Recommendations
Cites Work
- Power of words and recognizability of fixpoints of a substitution
- The ring of \(k\)-regular sequences
- Suites algébriques, automates et substitutions
- Substitution dynamical systems - spectral analysis
- Valeurs propres des systèmes dynamiques définis par des substitutions de longueur variable
- On the complexity of infinite sequences
- Minimal flows arising from substitutions of non-constant length
Cited In (67)
- The Jacobs-Keane theorem from the \(\mathcal{S}\)-adic viewpoint
- Bounded topological speedups
- Monochromatic arithmetic progressions in automatic sequences with group structure
- Conjugacy of unimodular Pisot substitution subshifts to domain exchanges
- Invariant measures for substitutions on countable alphabets
- Topological conjugacy for the Morse minimal system: an example
- Substitution-dynamics and invariant measures for infinite alphabet-path space
- Automaticity and Parikh-Collinear Morphisms
- Decidable problems in substitution shifts
- On the complexity of infinite words generated by countable \(q\)-automata
- Arithmetic and dynamical properties of the Rauzy fractal
- On the D0L Repetition Threshold
- Separators in infinite words generated by morphisms.
- Enumeration and decidable properties of automatic sequences
- Topological conjugacy of constant length substitution dynamical systems
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
- Recognizability of morphisms
- On factors of synchronized sequences
- On winning shifts of marked uniform substitutions
- Subword complexity and \(k\)-synchronization
- Symmetrized \(\beta \)-integers
- Rigidity and substitutive dendric words
- Geometric representation of substitutions of Pisot type
- Topological conjugacy to given constant length substitution minimal systems
- Power of words and recognizability of fixpoints of a substitution
- Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- The complexity of Fibonacci-like kneading sequences
- Birkhoff sum fluctuations in substitution dynamical systems
- On the triplex substitution -- combinatorial properties
- Subword complexity of uniform D0L words over finite groups
- Automatic complexity of shift register sequences
- On the joint subword complexity of automatic sequences
- Extended symmetry groups of multidimensional subshifts with hierarchical structure
- Coloring factors of substitutive infinite words
- Asymptotic subword complexity of fixed points of group substitutions
- The ring of \(k\)-regular sequences. II.
- Palindrome complexity.
- 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
- Measure-theoretic complexity of ergodic systems
- Automata calculating the complexity of automatic sequences
- Balancedness and coboundaries in symbolic systems
- Unimodular Pisot substitutions and their associated tiles
- Self-induced systems
- Geometry of the common dynamics of flipped Pisot substitutions
- Realtime subshifts
- Complexity and special factors
- Coding of substitution dynamical systems as shifts of finite type
- Spectral theory of \(\mathbb{Z}^{d}\) substitutions
- The constant of recognizability is computable for primitive morphisms
- On automorphism groups of low complexity subshifts
- On the context-freeness of the set of words containing overlaps
- Ancestors graph and an upper bound for the subword complexity function
- On the permutation complexity of the Cantor-like sequences
- On the subword complexity of Thue-Morse polynomial extractions
- Recognizability for sequences of morphisms
- The subword complexity of fixed points of binary uniform morphisms
- Title not available (Why is that?)
- Palindromic length of words and morphisms in class \(\mathcal{P}\)
- Multidimensional constant-length substitution sequences
- On maximal pattern complexity of some automatic words
- Prefix-suffix automaton associated with a primitive substitution
- Title not available (Why is that?)
- Characterization of circular D0L-systems
- Formulas for complexity, invariant measure and RQA characteristics of the period-doubling subshift
- Calculation of the complexities of substitutive sequences over a binary alphabet
- Complexity of automatic sequences
This page was built for publication: Reconnaissabilité des substitutions et complexité des suites automatiques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4716073)
