Deteministic Finite Automaton Implementation in Python Language
-
Updated
Oct 24, 2018 - Python
Deteministic Finite Automaton Implementation in Python Language
A program that can take a regex as input and return a deterministic finite automaton that recognises the same language.
A simple regex compiler which converts the regular expression into a dfa which can be simulated to check if a string matches the pattern...
Analizador léxico que genera y simula AFNs y AFDs a partir de una expresión regular
Automata project that will convert given regular expressions to DFA and CFG to PDA.
Add a description, image, and links to the regex-to-dfa topic page so that developers can more easily learn about it.
To associate your repository with the regex-to-dfa topic, visit your repo's landing page and select "manage topics."