GitHub - anthony-sv/Regex2NFA2DFA: Object Oriented Python project for computing a Deterministic Finite Automaton by Subset Contruction of a Nondeterministic Finite Automaton created by Thompson Construction for a given RegEx.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
__pycache__		__pycache__
AFD.py		AFD.py
AFN.py		AFN.py
Acceptor.py		Acceptor.py
Alphabet.py		Alphabet.py
AskAutomaton.py		AskAutomaton.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
Subset.py		Subset.py
Symbol.py		Symbol.py
Thompson.py		Thompson.py
Transition.py		Transition.py
dfa.gv		dfa.gv
dfa.png		dfa.png
nfa.gv		nfa.gv
nfa.png		nfa.png

About

Object Oriented Python project for computing a Deterministic Finite Automaton by Subset Contruction of a Nondeterministic Finite Automaton created by Thompson Construction for a given RegEx.