Last Updated :
02 Nov, 2018
Find a regular expression for the language recognized by given machine,
(A) ((0+1)0*1(0+1))*(0+1)0*
(B) ((0+1)+(0+1)1+0)*
(C) ((0+1)0*1(0+1))*(0+1)*
(D) None of the above
Answer: (A)
Explanation: Regular expression representing the language recognized by the original DFA: ((0+1)0*1(0+1))*(0+1)0*.
So, option (A) is correct.
Quiz of this Question
Share your thoughts in the comments
Please Login to comment...