Exploring the Crochemore and Ziv-Lempel factorizations of some automatic sequences with the software Walnut
Marieh Jahannia, Manon Stipulanti
TL;DR
This paper investigates the Ziv-Lempel and Crochemore factorizations of classical automatic sequences using the Walnut theorem prover to analyze their structural properties.
Contribution
It introduces a systematic approach to analyze automatic sequences' factorizations with Walnut, providing new insights into their structure.
Findings
Identified specific factorization patterns in automatic sequences
Demonstrated the effectiveness of Walnut in factorization analysis
Provided new theoretical results on sequence structure
Abstract
We explore the Ziv-Lempel and Crochemore factorizations of some classical automatic sequences making an extensive use of the theorem prover Walnut.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Algorithms and Data Compression · semigroups and automata theory