This bool. comb describes Corinna's automaton:
> States:  1 2 3 4 5
> Start state: 1
> Accepting states: 1 2 3 4
> Dead state: 5
>
> (1,a) -> 2
> (1,b) -> 3
> (1,c) -> 4
> (2,b) -> 2
> (2,c) -> 2
> (3,a) -> 3
> (3,c) -> 3
> (4,a) -> 4
> (4,b) -> 4
> (2,a) -> 5
> (3,b) -> 5
> (4,c) -> 5
>



M1 = bool2fsa_pt(' ((a)-((aa)+(ba)+(ca))) + ((b)-((ab)+(bb)+(cb))) +((c)-((ac)+(bc)+(cc)))+ ~(((a)+(b))+(c))   ','abc')

-----------
leoex:
Alphabet: "ab"
The states Q: 1  2  3  4  5  6
Start state: 1
dead state: 6
Accepting states: [2 3 4 5]
(  1,    a) ->   3
(  1,    b) ->   2
(  2,    b) ->   6
(  2,    a) ->   2
(  3,    b) ->   3
(  3,    a) ->   4
(  4,    b) ->   4
(  4,    a) ->   5
(  5,    b) ->   5
(  5,    a) ->   6

  1.  u=[]  w = -1.00000
  2.  u=[a]  w = 2.00000
  3.  u=[b]  w = 2.00000
  4.  u=[bb]  w = -2.00000
  5.  u=[bab]  w = -2.00000
  6.  u=[bba]  w = -2.00000
  7.  u=[aaaa]  w = -2.00000
  8.  u=[abab]  w = 2.00000
  9.  u=[abba]  w = 2.00000
 10.  u=[aaaab]  w = -2.00000
 11.  u=[aaaba]  w = -2.00000
 12.  u=[aabaa]  w = -2.00000
 13.  u=[abaaa]  w = -2.00000
 14.  u=[bababa]  w = -2.00000
 15.  u=[babbab]  w = -2.00000
 16.  u=[ababbab]  w = 2.00000