On factors of synchronized sequences

DOI10.1016/J.TCS.2010.08.005zbMath1238.68114OpenAlexW2086722443MaRDI QIDQ410714

Valerio D'Alonzo, Arturo Carpi

Publication date: 3 April 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.08.005

zbMATH Keywords

automatic sequencefactor complexitypalindromic complexitysynchronized sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (6)

Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences ⋮ Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties ⋮ First-Order Logic and Numeration Systems ⋮ ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES ⋮ AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS ⋮ A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Synchronized rational relations of finite and infinite words
• The ring of \(k\)-regular sequences
• Complexity and special factors
• The ring of \(k\)-regular sequences. II.
• Palindrome complexity.
• Singular continuous spectrum for palindromic Schrödinger operators
• On synchronized sequences and their separators
• Automatic Sequences
• Reconnaissabilité des substitutions et complexité des suites automatiques
• On Relations Defined by Generalized Finite Automata
• Uniform tag sequences

This page was built for publication: On factors of synchronized sequences