Synchronized sequences
From MaRDI portal
Recommendations
Cites work
- A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
- Automatic Sequences
- Characterizing regular languages with polynomial densities
- Combinatorial properties of f-palindromes in the Thue-Morse sequence
- Enumeration and decidable properties of automatic sequences
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 3397597 (Why is no real title available?)
- scientific article; zbMATH DE number 3076700 (Why is no real title available?)
- Logic and p-recognizable sets of integers
- Numeration systems, linear recurrences, and regular sets
- On integer sequences whose first iterates are linear
- On synchronized sequences and their separators
- ON THE REPETITIVITY INDEX OF INFINITE WORDS
- Subword complexity and k-synchronization
- Sur des points fixes de morphismes d'un monoïde libre
- The Frobenius problem for homomorphic embeddings of languages into the integers
- The ring of k-regular sequences
- The ring of \(k\)-regular sequences. II.
Cited in
(25)- Coherent sequences and threads
- On synchronized sequences and their separators
- Frobenius numbers and automatic sequences
- On factors of synchronized sequences
- Synchronized components of a subshift
- Subword complexity and k-synchronization
- Properties of a ternary infinite word
- Automatic sequences in negative bases and proofs of some conjectures of shevelev
- Some tribonacci conjectures
- Proving results about OEIS sequences with \texttt{Walnut}
- Dyck Words, Pattern Avoidance, and Automatic Sequences
- Rudin-Shapiro Sums via Automata Theory and Logic
- Note on a Fibonacci parity sequence
- Rarefied Thue-Morse sums via automata theory and logic
- Proof of a conjecture of Krawchuk and Rampersad on the cyclic complexity of the Thue-Morse sequence
- Pseudoperiodic words and a question of Shevelev
- Dyck words, pattern avoidance, and automatic sequences
- Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals
- Computing the base-\(b\) representation of quadratic irrationals using automata
- A self-generating sequence
- Self-verifying predicates in Büchi arithmetic
- Automatic proofs in combinatorial game theory
- Rudin-Shapiro sums via automata theory and logic
- Runs in paperfolding sequences
- Beatty sequences for a quadratic irrational: decidability and applications
This page was built for publication: Synchronized sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140455)
