Pages that link to "Item:Q4902892"
From MaRDI portal
The following pages link to ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES (Q4902892):
Displayed 41 items.
- Topological conjugacy of constant length substitution dynamical systems (Q505048) (← links)
- On the regularity of the Hankel determinant sequence of the characteristic sequence of powers of 2 (Q670648) (← links)
- On the permutation complexity of the Cantor-like sequences (Q906402) (← links)
- Morphisms on infinite alphabets, countable states automata and regular sequences (Q1674337) (← links)
- Additive number theory via automata theory (Q1987517) (← links)
- Robustness of Pisot-regular sequences (Q2020014) (← links)
- Minimal automaton for multiplying and translating the Thue-Morse set (Q2040011) (← links)
- Revisiting regular sequences in light of rational base numeration systems (Q2065907) (← links)
- Regular sequences and synchronized sequences in abstract numeration systems (Q2066012) (← links)
- Decidability and \(k\)-regular sequences (Q2077376) (← links)
- How to prove that a sequence is not automatic (Q2121041) (← links)
- Synchronized sequences (Q2140455) (← links)
- Derived sequences and the factor spectrum of the period-doubling sequence (Q2154584) (← links)
- Lie complexity of words (Q2163386) (← links)
- Asymptotic analysis of \(q\)-recursive sequences (Q2165029) (← links)
- On prefix palindromic length of automatic words (Q2235743) (← links)
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences (Q2256124) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences (Q2635089) (← links)
- Topological invariants for words of linear factor complexity (Q2672961) (← links)
- Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties (Q2974059) (← links)
- Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
- Effective S-adic Symbolic Dynamical Systems (Q3188236) (← links)
- A New Approach to the Paperfolding Sequences (Q3195678) (← links)
- Frobenius Numbers and Automatic Sequences (Q3390106) (← links)
- Mechanical Proofs of Properties of the Tribonacci Word (Q3449367) (← links)
- When is an automatic set an additive basis? (Q4577830) (← links)
- First-Order Logic and Numeration Systems (Q4613547) (← links)
- (Q5020521) (← links)
- The simplest binary word with only three squares (Q5021107) (← links)
- Automatic sequences of rank two (Q5044415) (← links)
- Automaticity and Invariant Measures of Linear Cellular Automata (Q5138775) (← links)
- From Combinatorial Games to Shape-Symmetric Morphisms (Q5141334) (← links)
- Prefix palindromic length of the Thue-Morse word (Q5212137) (← links)
- (Q5227519) (← links)
- ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING) (Q5247177) (← links)
- Bracket words: A generalisation of Sturmian words arising from generalised polynomials (Q6112894) (← links)
- Automaticity and Parikh-Collinear Morphisms (Q6134878) (← links)
- Note on a Fibonacci parity sequence (Q6159442) (← links)
- An Inequality for the Number of Periods in a Word (Q6169892) (← links)