GitHub - anthony-sv/regex-2-NFA: Object Oriented Python project for converting a given Regular Expression to a Nondeterministic Finite Automaton by Thompson Construction.

anthony-sv / regex-2-NFA Public

Object Oriented Python project for converting a given Regular Expression to a Nondeterministic Finite Automaton by Thompson Construction.

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
DiagramaClases		DiagramaClases
__pycache__		__pycache__
AFN.py		AFN.py
Acceptor.py		Acceptor.py
Alphabet.py		Alphabet.py
FSM.py		FSM.py
Main.py		Main.py
PlotAutomaton.py		PlotAutomaton.py
Postfix.py		Postfix.py
Regex.py		Regex.py
Stack.py		Stack.py
State.py		State.py
Symbol.py		Symbol.py
Thompson.py		Thompson.py
Transition.py		Transition.py
dot1.gv		dot1.gv
dot1.png		dot1.png