CSE 355 project to validate requirements through Finite Automata.
Eric Arellano, ecarell1
Assumes Haskell Stack installed.
stack setup
stack build
stack exec automata-model-exe [path-to-input.txt]
stack ghci
:set args [path-to-input.txt]
main
:r
:q
- It is okay to renumber the states when converting from NFA -> DFA or taking the intersection.