Convert the following regular expression into equivalent Finite Automata

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

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

 

  • Answered by oriattic
  • 0 Comments
  • 11 months ago

This answer is restricted. Please login to view the answer of this question.

Login Now
Leave your Answer:

Click here to submit your answer.

s
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments