A separation of and b via Thue-Morse words

DOI10.1007/978-3-030-86692-1_14MaRDI QIDQ2146136zbMATH OpenOpenAlexFDO

Authors Hideo Bannai, Mitsuru Funakoshi, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto, 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 combinatorial view on string attractors
• A universal algorithm for sequential data compression
• At the roots of dictionary compression: string attractors
• Burrows-Wheeler transform and Sturmian words
• Data compression via textual substitution
• On the Approximation Ratio of Ordered Parsings
• Towards a definitive measure of repetitiveness

Cited in

(7)

• A Separation of \gamma and b via Thue--Morse Words
• Iterated straight-line programs
• Computing NP-hard repetitiveness measures via MAX-SAT
• Repetitiveness measures based on string morphisms
• Generalized straight-line programs
• Computing NP-hard repetitiveness measures via MAX-SAT
• Net occurrences in Fibonacci and Thue-Morse words

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)