Convert the following regular expression into equivalent Finite Automata.
a. (0+1)*(10(1+0)
b. 1*0(0+1)*1
This question doesn't have any answer. Please request admin for answer or submit your own answer.
Submit AnswerClick here to submit your answer.
