Repositories list

• 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.

  C++

  •

  MIT License

  •0•2•0•0•Updated Aug 14, 2024Aug 14, 2024

• DeterministicWidth

  Public
  Tool to compute the deterministic width of a regular language

  C++

  •

  MIT License

  •0•0•0•0•Updated Jul 18, 2024Jul 18, 2024

• finite-automata-partition-refinement

  Public
  A tool to sort Wheeler NFA and prune finite automata using partition refinement algorithm

  C++

  •

  MIT License

  •0•1•0•0•Updated Jul 4, 2024Jul 4, 2024

• suffixient

  Public
  Compute the smallest suffixient-nexessary set of a string

  C++

  •

  MIT License

  •0•2•0•0•Updated Jun 20, 2024Jun 20, 2024

• Labeled-Graph-LCP

  Public
  This is a software to compute the LCP of a deterministic Wheeler pseudoforest

  C++

  •

  MIT License

  •0•2•0•0•Updated Mar 5, 2024Mar 5, 2024

• RegexpWidth

  Public
  This is a tool to compute the width of a given Regexp

  C++

  •

  MIT License

  •0•0•0•0•Updated Feb 27, 2024Feb 27, 2024

• rho-repetitiveness

  Public
  Compute statistics on the suffix link tree

  C++

  •

  MIT License

  •0•2•0•0•Updated Jan 29, 2024Jan 29, 2024

• Wheeler-language-recognizer

  Public archive
  Tool to check if a regular expression recognizes a Wheeler language

  C++

  •

  MIT License

  •0•2•0•0•Updated Jan 18, 2024Jan 18, 2024

• RegexpToAutomaton

  Public
  Tool to compute an automaton out of a regexp.

  C++

  •

  MIT License

  •0•0•0•0•Updated Dec 12, 2023Dec 12, 2023

• Wheeler-DFA-generation

  Public
  Algorithm to uniformly generate Wheeler DFA

  C++

  •

  MIT License

  •0•1•0•0•Updated Jul 7, 2023Jul 7, 2023

• DFA-suffix-doubling

  Public
  Suffix doubling algorithm for co-lex sorting DFA nodes

  C++

  •

  MIT License

  •0•1•0•0•Updated Apr 15, 2023Apr 15, 2023