An implementation of regular expressions for Python that uses a finite state automaton(正则引擎的Python实现,包括从NFA到DFA和DFA的最小化)
-
Updated
Jan 2, 2023 - Python
An implementation of regular expressions for Python that uses a finite state automaton(正则引擎的Python实现,包括从NFA到DFA和DFA的最小化)
Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.
A Python implementation to convert a Deterministic Finite Automata to Regular Expression using state elimination method
Finite Automata and Regular Expressions for Regular Languages in Haskell
Converts a given regular expression into a NFA(Thompson's construction) then converts that NFA to a DFA(Subset construction)
Projet CY-Tech
Implementation Of finite State Machines In JAVA
Conversions between NFA, DFA, regex and DFA minimization, Automata Theory | Spring 2021
A Powerful and Fast regex engine. Featuring pure DFA match, Thompson NFA match(extended regex should be supported soon), regex operation(union, intersection , complementary), DFA to regex is also available
Codes to convert Regex-to-NFA, NFA-to-DFA, DFA -to-Regex, minimizing DFA.
Add a description, image, and links to the dfa-to-regex topic page so that developers can more easily learn about it.
To associate your repository with the dfa-to-regex topic, visit your repo's landing page and select "manage topics."