A separation of and b via Thue-Morse words

DOI10.1007/978-3-030-86692-1_14OpenAlexW3203025738MaRDI QIDQ2146136FDOQ2146136

Mitsuru Funakoshi, Hideo Bannai, Takuya Mieno, Takaaki Nishimoto, Dominik Köppl, Tomohiro I

Publication date: 15 June 2022

Full work available at URL: https://arxiv.org/abs/2104.09985

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• A universal algorithm for sequential data compression
• Data compression via textual substitution
• Burrows-Wheeler transform and Sturmian words
• At the roots of dictionary compression: string attractors
• Towards a definitive measure of repetitiveness
• A combinatorial view on string attractors
• On the Approximation Ratio of Ordered Parsings

Cited In (2)

• A Separation of $\gamma$ and $b$ via Thue--Morse Words
• Iterated straight-line programs

This page was built for publication: A separation of \(\gamma\) and \(b\) via Thue-Morse words

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