Exploring the Crochemore and Ziv-Lempel factorizations of some automatic sequences with the software Walnut

2024/03/22 by Jahannia, Marieh, Stipulanti, Manon
#1B85 #68R15 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics

paper · doi:10.48550/arxiv.2403.15215

Abstract

We explore the Ziv-Lempel and Crochemore factorizations of some classical automatic sequences making an extensive use of the theorem prover Walnut.

Related

• Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci\n Infinite Words
• Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton
• Using Walnut to solve problems from the OEIS
• Transduction of Automatic Sequences and Applications
• Automatic Theorem Proving in Walnut