The content delves into the sensitivity analysis of lex-parse with respect to edit operations and alphabet ordering using Fibonacci words. The study provides insights into compression sensitivity and repetitiveness measures, showcasing the robustness of lex-parse. The analysis reveals tight upper and lower bounds for both edit operations and alphabet ordering sensitivity. Various structures and properties of strings, including Lyndon factorization and Fibonacci words, are explored to characterize the lex-parse structure.
Introduction
Preliminaries
Sensitivity of Lex-parse
Upper Bounds
Lower Bounds for Edit Operations
Lower Bounds for Alphabet-Ordering
Acknowledgments
To Another Language
from source content
arxiv.org
Önemli Bilgiler Şuradan Elde Edildi
by Yuto... : arxiv.org 03-01-2024
https://arxiv.org/pdf/2402.19223.pdfDaha Derin Sorular