Repetition factorization of automatic sequences

DOI10.1142/S0129054124430019MaRDI QIDQ6989489zbMATH OpenFDO

Authors Narad Rampersad, Jeffrey Shallit, Xinhao Xu

Publication date 30 April 2025

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

automatic sequenceFibonacci sequencepaperfolding sequenceperiodicityThue-Morse sequencerepetitionWalnutrepetition factorizationRudi-Shapiro sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Cites work

• scientific article; zbMATH DE number 3947643 (Why is no real title available?)
• scientific article; zbMATH DE number 3229502 (Why is no real title available?)
• scientific article; zbMATH DE number 3397597 (Why is no real title available?)
• scientific article; zbMATH DE number 3076700 (Why is no real title available?)
• Automatic Sequences
• Factorizing strings into repetitions
• Largest repetition factorization of Fibonacci words
• Logic and p-recognizable sets of integers
• Some Theorems on Fourier Coefficients
• The Logical Approach to Automatic Sequences
• The first-order theory of binary overlap-free words is decidable
• The structure of the set of cube-free Z-words in a two-letter alphabet
• Uniformly growing k-th power-free homomorphisms
• Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen.

This page was built for publication: Repetition factorization of automatic sequences

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