research
∙
11/03/2021
Linear-time Minimization of Wheeler DFAs
Wheeler DFAs (WDFAs) are a sub-class of finite-state automata which is p...
share
research
∙
02/25/2021
Algorithms and Complexity on Indexing Founder Graphs
We study the problem of matching a string in a labeled graph. Previous r...
research
∙
02/04/2019
On Prefix-Sorting Finite Automata
Being able to efficiently test the membership of a word in a formal lang...
research
∙
11/06/2018
