2 citations · 6 across the 31 of their papers we have counts for
4 papers · 1 filter
Online computation of maximal closed substrings
Hiroki Shibata, Haruki Umezaki, Takuya Mieno +2
A non-empty string is closed if it has length one or its longest border appears exactly twice in the string. An occurrence of a closed substring is a maximal closed substring (MCS)…
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…
Online Computation of Palindromes and Suffix Trees on Tries
Hiroki Shibata, Mitsuru Funakoshi, Takuya Mieno +5
We consider the problems of computing maximal palindromes and distinct palindromes in a trie. A trie is a natural generalization of a string, which can be seen as a single-path tre…