Wheeler DFAs (WDFAs) are a sub-class of finite-state automata which is
p...
We study the problem of matching a string in a labeled graph. Previous
r...
Being able to efficiently test the membership of a word in a formal lang...
The Burrows-Wheeler Transform (BWT) is an important technique both in da...