2 citations · 6 across the 31 of their papers we have counts for
4 papers · 1 filter
Relaxation of Square-Freeness
Hiroki Shibata, Takuya Mieno, Dominik Köppl +1
We extend the analysis of nonrepetitive sequences of Entringer et al. [Journal of Combinatorial Theory, 1974] to relaxations of equality testing under nonstandard equivalence relat…
The Smallest String Attractors of Fibonacci, Period-Doubling, and Thue--Morse Words
Mutsunori Banbara, Hideo Bannai, Peaker Guo +3
A string attractor of a string is a set of positions of such that any nonempty substring of has an occurrence that crosses a position in , i.e., ther…
RePair Grammars are the Smallest Grammars for Fibonacci Words
Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
Grammar-based compression is a loss-less data compression scheme that represents a given string by a context-free grammar that generates only . While computing the smallest…
Combinatorics of minimal absent words for a sliding window
Tooru Akagi, Yuki Kuhara, Takuya Mieno +4
A string is called a minimal absent word (MAW) for another string if does not occur in but the proper substrings of occur in . For example, let $Σ= \{\mathtt…