Prefix Sorting DFAs: A Recursive Algorithm
Published in arXiv (Cornell University) • Jan 1, 2023
Authors:
Nicola Cotumaccio
Abstract
In the past thirty years, numerous algorithms for building the suffix array of a string have been proposed. In 2021, the notion of suffix array was extended from strings to DFAs, and it was shown that the resulting data structure can be built in O(m² + n^{5/2}) time, where n is the number of states ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!