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++ 3
-
Wheeler-language-recognizer
Wheeler-language-recognizer Public archiveTool to check if a regular expression recognizes a Wheeler language
C++ 2
-
-
Labeled-Graph-LCP
Labeled-Graph-LCP PublicThis is a software to compute the LCP of a deterministic Wheeler pseudoforest
C++ 2
-
-
DFA-suffix-doubling
DFA-suffix-doubling PublicSuffix doubling algorithm for co-lex sorting DFA nodes
C++ 1
Repositories
- trie-measure Public
Tools related to the trie measure (computation of the measure, data structure for a sequence of sets, etc. )
regindex/trie-measure’s past year of commit activity - 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.
regindex/substring-complexity’s past year of commit activity - finite-automata-partition-refinement Public
A tool to sort Wheeler NFA and prune finite automata using partition refinement algorithm
regindex/finite-automata-partition-refinement’s past year of commit activity - Labeled-Graph-LCP Public
This is a software to compute the LCP of a deterministic Wheeler pseudoforest
regindex/Labeled-Graph-LCP’s past year of commit activity - Wheeler-language-recognizer Public archive
Tool to check if a regular expression recognizes a Wheeler language
regindex/Wheeler-language-recognizer’s past year of commit activity