Im struggling to understand how to transform Nondeterministic finite automaton (NFA) of the following form:
To a regular expression equivalent. What I have tried was using arden's rule. However I just cant figure out how to simplify and return the appropriate regular expression corresponding to that NFA.
First I have created the initial equation corresponding to those states:
$1: q3 = q_1 0 + q_1 1$
$2: q1 = q_0 0 + q_1 1$
$3: q0 = q_0 0 + q_0 1 + \epsilon$
Which I have tried to simplify:
$1: q3 = (q_0 0 + q_1 1)0 + (q_0 0 + q_1)1$
$1: q3 = q_0 00 + q_1 100 + q_0 01 + q_1 11$
$1: q3 = q_0(0+1) + q_1(0+1)$
$2: q1 = q_0 00 + q_0 10 + \epsilon 0 + q_0 01 + q_1 11$
$2: q1 = q_0(0+0+1)+ \epsilon 0 + q_1 11$
$3: q0 = q_0 0 + q_0 1 + \epsilon$
$3: q0 = q_0(0+1) + \epsilon$
Here I just lost. Maybe there is a different approach suitable in this context.
Appreciate any help!