Regular expr

Question

from an initial state to remaining states are parallel , what is RE for above FSM??

Comments

$a.a^{*}( (b+c) + a.(b+c))^{*} + b.b^{*}.( (a+c) + b.(a+c ))^{*} + c.c^{*}. ( (a+b) + c.(a+b))^{*}$

Answer 1

The given Finite State Automata is over the alphabet {a,b,c} It is accepting all the strings which start with a particular alphabet and end with another alphabet i.e they do not start and end with the same alphabet .

The regukar expression is:=a(a^*+b+c)^*(b+c)+b(b^*+a+c)*(a+c)+c(a+b+c^*)*(a+b)// (x^*+y+z)^* is  equivalent to (x+y+z)*

=a(a+b+c)*(b+c)+b(b+a+c)*(a+c)+c(a+b+c)*(a+b) Ans