regindex
Popular repositories Loading
-
-
-
substring-complexity
substring-complexity Publiccompute/approximate the substring complexity measure delta = max_k (d_k/k), where d_k is the number of distinct factors of length k of the input string.
C++ 4
-
finite-automata-partition-refinement
finite-automata-partition-refinement PublicA tool to sort Wheeler NFA and prune finite automata using partition refinement algorithm
C++ 3
-
Wheeler-language-recognizer
Wheeler-language-recognizer Public archiveTool to check if a regular expression recognizes a Wheeler language
C++ 3
-
Repositories
- Minimum-WDFA-Constructor Public
Tool to construct the minimal Wheeler DFA equivalent to an input DFA that accepts a Wheeler language.
- Gr-SA Public
- substring-complexity Public
compute/approximate the substring complexity measure delta = max_k (d_k/k), where d_k is the number of distinct factors of length k of the input string.
- NFA-index Public
- finite-automata-partition-refinement Public
A tool to sort Wheeler NFA and prune finite automata using partition refinement algorithm
- trie-measure Public
Tools related to the trie measure (computation of the measure, data structure for a sequence of sets, etc. )
Top languages
Loading…
Most used topics
Loading…