A Separation of $\gamma$ and $b$ via Thue--Morse Words
暂无分享,去创建一个
Hideo Bannai | I Tomohiro | Mitsuru Funakoshi | Takuya Mieno | Takaaki Nishimoto | Dominik Koeppl | H. Bannai | I. Tomohiro | Takuya Mieno | Mitsuru Funakoshi | T. Nishimoto | Dominik Köppl
[1] Harold Marston Morse. Recurrent geodesics on a surface of negative curvature , 1921 .
[2] D. J. Wheeler,et al. A Block-sorting Lossless Data Compression Algorithm , 1994 .
[3] Hideo Bannai,et al. On repetitiveness measures of Thue-Morse words , 2020, SPIRE.
[4] James A. Storer,et al. Data compression via textual substitution , 1982, JACM.
[5] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.
[6] Dominik Kempa,et al. At the roots of dictionary compression: string attractors , 2017, STOC.
[7] Antonio Restivo,et al. Burrows-Wheeler transform and Sturmian words , 2003, Inf. Process. Lett..
[8] Gonzalo Navarro,et al. On the Approximation Ratio of Ordered Parsings , 2021, IEEE Transactions on Information Theory.
[9] Antonio Restivo,et al. A combinatorial view on string attractors , 2021, Theor. Comput. Sci..
[10] Tomasz Kociumaka,et al. Resolution of the Burrows-Wheeler Transform Conjecture , 2019, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[11] G. Navarro,et al. Towards a Definitive Measure of Repetitiveness , 2019, LATIN.
[12] Jean Berstel,et al. Combinatorics on words: Square-Free Words and Idempotent Semigroups , 1997 .
[13] G. Navarro. Indexing Highly Repetitive String Collections, Part I: Repetitiveness Measures , 2020 .
[14] Antonio Restivo,et al. String Attractors and Combinatorics on Words , 2019, ICTCS.