Skip to content
Change the repository type filter

All

    Repositories list

    • Tools related to the trie measure (computation of the measure, data structure for a sequence of sets, etc. )
      C++
      MIT License
      0000Updated Nov 19, 2024Nov 19, 2024
    • 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.
      C++
      MIT License
      0300Updated Aug 14, 2024Aug 14, 2024
    • Tool to compute the deterministic width of a regular language
      C++
      MIT License
      0000Updated Jul 18, 2024Jul 18, 2024
    • A tool to sort Wheeler NFA and prune finite automata using partition refinement algorithm
      C++
      MIT License
      0100Updated Jul 4, 2024Jul 4, 2024
    • Compute the smallest suffixient-nexessary set of a string
      C++
      MIT License
      0200Updated Jun 20, 2024Jun 20, 2024
    • This is a software to compute the LCP of a deterministic Wheeler pseudoforest
      C++
      MIT License
      0200Updated Mar 5, 2024Mar 5, 2024
    • This is a tool to compute the width of a given Regexp
      C++
      MIT License
      0000Updated Feb 27, 2024Feb 27, 2024
    • Compute statistics on the suffix link tree
      C++
      MIT License
      0200Updated Jan 29, 2024Jan 29, 2024
    • Tool to check if a regular expression recognizes a Wheeler language
      C++
      MIT License
      0200Updated Jan 18, 2024Jan 18, 2024
    • Tool to compute an automaton out of a regexp.
      C++
      MIT License
      0000Updated Dec 12, 2023Dec 12, 2023
    • Algorithm to uniformly generate Wheeler DFA
      C++
      MIT License
      0100Updated Jul 7, 2023Jul 7, 2023
    • Suffix doubling algorithm for co-lex sorting DFA nodes
      C++
      MIT License
      0100Updated Apr 15, 2023Apr 15, 2023