Problem with creating a deterministic finite automata (DFA) - Mercury
- by Jabba The hut
I would like to have a deterministic finite automata (DFA) simulated in Mercury.
But I’m s(t)uck at several places.
Formally, a DFA is described with the following characteristics:
a setOfStates S,
an inputAlphabet E <-- summation symbol,
a transitionFunction : S × E -- S,
a startState s € S,
a setOfAcceptableFinalStates F =C S.
A…