On synchronized sequences and their separators

DOI10.1051/ITA:2001129MaRDI QIDQ3147019zbMATH OpenOpenAlexFDO

Authors Cristiano Maggi, Arturo Carpi

Publication date 9 October 2002

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2001__35_6_513_0, http://www.numdam.org/item?id=ITA_2001__35_6_513_0/, https://eudml.org/doc/221953

zbMATH Keywords

\(k\)-synchronized sequence

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• On factors of synchronized sequences
• Synchronized sequences
• Subword complexity and k-synchronization
• The ring of k-regular sequences
• Automatic Sequences

Cites work

• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• Automaticity. II: Descriptional complexity in the unary case
• Confluent linear numeration systems
• Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
• On Relations Defined by Generalized Finite Automata
• Separators in infinite words generated by morphisms.
• Suites algébriques, automates et substitutions
• Synchronized rational relations of finite and infinite words
• The ring of k-regular sequences
• Uniform tag sequences

Cited in

(25)

• ON THE REPETITIVITY INDEX OF INFINITE WORDS
• Rudin-Shapiro Sums via Automata Theory and Logic
• Enumeration and decidable properties of automatic sequences
• On factors of synchronized sequences
• General framework
• Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.
• How to prove that a sequence is not automatic
• Counting subword occurrences in base-b expansions
• First-order logic and numeration systems
• Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
• Rudin-Shapiro sums via automata theory and logic
• Synchronized sequences
• Computing the base-\(b\) representation of quadratic irrationals using automata
• From combinatorial games to shape-symmetric morphisms
• Frobenius numbers and automatic sequences
• Counting the number of non-zero coefficients in rows of generalized Pascal triangles
• On train-track splitting sequences
• Automatic theorem-proving in combinatorics on words
• Regular sequences and synchronized sequences in abstract numeration systems
• Additive word complexity and \texttt{Walnut}
• Abelian complexity and synchronization
• On digital sequences associated with Pascal's triangle
• Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals
• Automatic proofs in combinatorial game theory
• Deciding game invariance

This page was built for publication: On synchronized sequences and their separators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147019)