Synchronized sequences
From MaRDI portal
Publication:2140455
DOI10.1007/978-3-030-85088-3_1zbMATH Open1494.68208OpenAlexW4255347277MaRDI QIDQ2140455FDOQ2140455
Authors: Jeffrey Shallit 
Publication date: 20 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-85088-3_1
Recommendations
Formal languages and automata (68Q45) Combinatorics on words (68R15) Automata sequences (11B85) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- Title not available (Why is that?)
- The ring of \(k\)-regular sequences
- Automatic Sequences
- Logic and \(p\)-recognizable sets of integers
- The ring of \(k\)-regular sequences. II.
- On integer sequences whose first iterates are linear
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial properties of \(f\)-palindromes in the Thue-Morse sequence
- Numeration systems, linear recurrences, and regular sets
- On synchronized sequences and their separators
- ON THE REPETITIVITY INDEX OF INFINITE WORDS
- Enumeration and decidable properties of automatic sequences
- Subword complexity and \(k\)-synchronization
- Sur des points fixes de morphismes d'un monoïde libre
- Characterizing regular languages with polynomial densities
- The Frobenius problem for homomorphic embeddings of languages into the integers
- A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
Cited In (18)
- Coherent sequences and threads
- Synchronized components of a subshift
- Rudin-Shapiro Sums via Automata Theory and Logic
- Pseudoperiodic words and a question of Shevelev
- On factors of synchronized sequences
- Subword complexity and \(k\)-synchronization
- Note on a Fibonacci parity sequence
- Automatic sequences in negative bases and proofs of some conjectures of shevelev
- Dyck Words, Pattern Avoidance, and Automatic Sequences
- Dyck words, pattern avoidance, and automatic sequences
- Rarefied Thue-Morse sums via automata theory and logic
- Frobenius numbers and automatic sequences
- On synchronized sequences and their separators
- Using finite automata to compute the base-\(b\) representation of the golden ratio and other quadratic irrationals
- Proving results about OEIS sequences with \texttt{Walnut}
- Proof of a conjecture of Krawchuk and Rampersad on the cyclic complexity of the Thue-Morse sequence
- Title not available (Why is that?)
- Properties of a ternary infinite word
Uses Software
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)
