module Lecture3
where

import Auxfuns
import qualified NFAe as Ne
import NFAe (eclosure)
import qualified NFA as N
import qualified DFA as D
import qualified GNFA as G
import Transform
import MyhillNerode
import PP
import PrintDFA
import PrintNFA
import PrintNFAe
import PrintGNFA
import PrintRegExp
import List
import Graphviz
import HW1

n1 = pnG N.mc
n2 = pnG (nfaToDfa N.mc)
n3 = pnG (reachableDFA $ nfaToDfa N.mc)

n4 = reToNFAe (parseRegExp "a+bc+de*")
n5 = pnG n4
n6 = nfaeToDfa n4
n7 = reachableDFA n6

n8 = pnG(close [3] n4)
n9 = pnG(close [5] n4)
          
n10 = pnG (mh rsum2)  -- This generates the min DFA for forward sums

n11 = G.nfaeToGnfa Ne.mc

n12 = pnG $ G.gnfaToRegExp n11

n13 = animateG n11  -- This creates files animate*.pdf in the current directory