Garmelon/rextra
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Visualize the automata using GraphViz

Browse source
This commit is contained in:
Joscha 2019-10-26 18:18:08 +00:00
parent 34a3a2027c
commit 10db66edc0
5 changed files with 98 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

4
src/Rextra/Automaton.hs
View file

@ -45,10 +45,10 @@ dfaStateToNfaState s =
dfaToNfa :: (Ord s, Ord t) => Dfa.Dfa s t -> Nfa.Nfa s t
dfaToNfa dfa =
let stateMap = Dfa.stateMap dfa
exitingStates = map fst . filter (\(s, state) -> Dfa.accepting state) $ Map.assocs stateMap
exitStates = Dfa.exitStates dfa
nfaStateMap = Map.map dfaStateToNfaState stateMap
-- The NFA was created from a valid DFA, so it will be valid too.
in fromJust $ Nfa.nfa nfaStateMap (Dfa.entryState dfa) (Set.fromList exitingStates)
in fromJust $ Nfa.nfa nfaStateMap (Dfa.entryState dfa) exitStates
{-
- Converting a NFA to a DFA