On factors of synchronized sequences

DOI10.1016/J.TCS.2010.08.005MaRDI QIDQ410714zbMATH OpenOpenAlexFDO

Authors Arturo Carpi, Valerio D'Alonzo

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)

Recommendations

• On synchronized sequences and their separators
• Subword complexity and k-synchronization
• Synchronized sequences
• Abelian complexity and synchronization
• Complexity of automatic sequences

Cites work

• Automatic Sequences
• Complexity and special factors
• scientific article; zbMATH DE number 3915644 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• On Relations Defined by Generalized Finite Automata
• On synchronized sequences and their separators
• Palindrome complexity.
• Reconnaissabilité des substitutions et complexité des suites automatiques
• Singular continuous spectrum for palindromic Schrödinger operators
• Synchronized rational relations of finite and infinite words
• The ring of k-regular sequences
• The ring of \(k\)-regular sequences. II.
• Uniform tag sequences

Cited in

(11)

• Synchronized sequences
• A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
• Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
• Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.
• On synchronized sequences and their separators
• First-order logic and numeration systems
• Enumeration and decidable properties of automatic sequences
• Subword complexity and k-synchronization
• Automatic theorem-proving in combinatorics on words
• Linear recurrence sequence automata and the addition of abstract numeration systems
• The reflection complexity of sequences over finite alphabets

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

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