These two equivalent formulae results in different automatae:
true -> (G(tok0 -> Fsends0) && GFg0) (1)
(G(tok0 -> Fsends0) && GFg0) (2)
..and corresponding automaton for the formula (1) (4 states):
..and the automaton for formula (2) contains 5 states, one more than previous:
..hacky way to optimize your automaton..
true -> (G(tok0 -> Fsends0) && GFg0) (1)
(G(tok0 -> Fsends0) && GFg0) (2)
..and corresponding automaton for the formula (1) (4 states):
..and the automaton for formula (2) contains 5 states, one more than previous:
..hacky way to optimize your automaton..
No comments:
Post a Comment