Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences

Documenti analoghi

• The reflection complexity of sequences over finite alphabets
  di: Allouche, Jean-Paul, et al.
  Pubblicazione: (2024)
• Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
  di: Hendel, Russell Jay
  Pubblicazione: (2025)
• Positionality of Dumont--Thomas numeration systems for integers
  di: Kreczman, Savinien, et al.
  Pubblicazione: (2025)
• Dissecting power of intersection of two context-free languages
  di: Rukavicka, Josef
  Pubblicazione: (2020)
• Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems
  di: Carton, Olivier, et al.
  Pubblicazione: (2024)