Consider the following machine. Select correct option.
Where = The all strings accepted at B state, if B is final.
= The all strings accepted at C state, if C is final.
We can conclude the relation between and fast by Arden’s Theorem i.e. if B is final then Language of this machine is and if C is final then Language of this machine is .
We consider that B is final state then given language is .
Now we reach state B by D.0 or B.1 or C.0.
Same way we can calculate for state C.
Now if we see properly and is same.
So, = , hence option c is correct.