GitHub - anthony-sv/Regex2DFA: Object Oriented Python project for converting a given Regular Expression to a Definite Finite Automaton by Tree Construction Algorithm(direct method).

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 9 Commits
__pycache__		__pycache__
AFD.py		AFD.py
Acceptor.py		Acceptor.py
Algorithm.py		Algorithm.py
Alphabet.py		Alphabet.py
FSM.py		FSM.py
Main.py		Main.py
Node.py		Node.py
PlotAutomaton.py		PlotAutomaton.py
PlotTree.py		PlotTree.py
Postfix.py		Postfix.py
Regex.py		Regex.py
Stack.py		Stack.py
State.py		State.py
Symbol.py		Symbol.py
SyntaxNode.py		SyntaxNode.py
SyntaxTree.py		SyntaxTree.py
Thompson.py		Thompson.py
Transition.py		Transition.py
Tree.py		Tree.py
dfa.gv		dfa.gv
dfa.png		dfa.png
syntax.gv		syntax.gv
tree.gv		tree.gv
tree.png		tree.png

About

Object Oriented Python project for converting a given Regular Expression to a Definite Finite Automaton by Tree Construction Algorithm(direct method).