3 citations · 11 across the 16 of their papers we have counts for
4 papers · 1 filter
Generalized Dictionary Matching under Substring Consistent Equivalence Relations
Diptarama Hendrian
Given a set of patterns called a dictionary and a text, the dictionary matching problem is a task to find all occurrence positions of all patterns in the text. The dictionary match…
Query Learning Algorithm for Residual Symbolic Finite Automata
Kaizaburo Chubachi, Diptarama Hendrian, Ryo Yoshinaka +1
We propose a query learning algorithm for residual symbolic finite automata (RSFAs). Symbolic finite automata (SFAs) are finite automata whose transitions are labeled by predicates…
An Extension of Linear-size Suffix Tries for Parameterized Strings
Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka +1
In this paper, we propose a new indexing structure for parameterized strings which we call PLSTs, by generalizing linear-size suffix tries for ordinary strings. Two parameterized s…
Online Algorithms for Constructing Linear-size Suffix Trie
Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga
The suffix trees are fundamental data structures for various kinds of string processing. The suffix tree of a string of length has nodes and edges, and the string la…