Automata calculating the complexity of automatic sequences
From MaRDI portal
Publication:1340682
DOI10.5802/JTNB.109zbMATH Open0815.11015OpenAlexW2314536985MaRDI QIDQ1340682FDOQ1340682
Authors: Théodore Tapsoba 
Publication date: 9 July 1995
Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=JTNB_1994__6_1_127_0
Recommendations
Cites Work
- Title not available (Why is that?)
- Suites algébriques, automates et substitutions
- Uniform tag sequences
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Title not available (Why is that?)
- Enumeration of factors in the Thue-Morse word
- Title not available (Why is that?)
- Automata calculating the complexity of automatic sequences
- Title not available (Why is that?)
Cited In (26)
- On the D0L Repetition Threshold
- Separators in infinite words generated by morphisms.
- Minimum complexity of automatic non sturmian sequences
- Subword complexity and \(k\)-synchronization
- Behavior of various complexity functions
- The ring of \(k\)-regular sequences
- Subword complexity of uniform D0L words over finite groups
- Automatic complexity of shift register sequences
- On the computational complexity of the Arnold complexity of binary words
- Asymptotic subword complexity of fixed points of group substitutions
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Calculating with Automata
- Automata calculating the complexity of automatic sequences
- Special factors of automatic sequences
- Complexity and special factors
- On the context-freeness of the set of words containing overlaps
- On the permutation complexity of the Cantor-like sequences
- On the subword complexity of Thue-Morse polynomial extractions
- The subword complexity of fixed points of binary uniform morphisms
- Complexity of generalized Rudin-Shapiro sequences
- Shift registers fool finite automata
- Entropy analysis of substitutive sequences revisited
- Calculation of the complexities of substitutive sequences over a binary alphabet
- Représentation géométrique de suites de complexité $2n+1$
- Computing the prefix of an automaton
- Complexity of automatic sequences
This page was built for publication: Automata calculating the complexity of automatic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340682)
