Synchronized sequences
From MaRDI portal
Publication:2140455
DOI10.1007/978-3-030-85088-3_1zbMath1494.68208OpenAlexW4255347277MaRDI QIDQ2140455
Publication date: 20 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-85088-3_1
Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata sequences (11B85) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (9)
Properties of a ternary infinite word ⋮ Automatic sequences in negative bases and proofs of some conjectures of shevelev ⋮ Frobenius Numbers and Automatic Sequences ⋮ 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 ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The ring of \(k\)-regular sequences
- Logic and \(p\)-recognizable sets of integers
- Numeration systems, linear recurrences, and regular sets
- The ring of \(k\)-regular sequences. II.
- The Frobenius problem for homomorphic embeddings of languages into the integers
- On integer sequences whose first iterates are linear
- Sur des points fixes de morphismes d'un monoïde libre
- On synchronized sequences and their separators
- ON THE REPETITIVITY INDEX OF INFINITE WORDS
- Automatic Sequences
- A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- Characterizing regular languages with polynomial densities
- Subword Complexity and k-Synchronization
This page was built for publication: Synchronized sequences
