This project aims to simplify regular expressions using unique identifiers for equivalent expressions. It integrates various representations of regular languages and provides efficient algorithms for simplification and conversion. The system includes an additional layer for optimizing expression size using a Union-Find structure.
regular-expressions regular-languages deterministic-finite-automata finite-automata efficient-data-structures simplification-of-regular-expressions comparison-of-regular-expressions derivatives-of-regular-expressions equivalence-of-regular-expressions extended-regular-expressions minimal-deterministic-finite-automata operations-on-regular-languages regular-equation-systems imperative-programming-with-java
-
Updated
Jul 30, 2024 - Java