Convert the following regular expression into equivalent Finite Automata.

a. (0+1)*(10(1+0)

b. 1*0(0+1)*1

  • 0 Comments
  • 1 year ago

This question doesn't have any answer. Please request admin for answer or submit your own answer.

Submit Answer
Leave your Answer:

Click here to submit your answer.

s
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments