2 years ago

Convert the following regular expression into equivalent Finite Automata.

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

b. 10(0+1)*1

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

Submit Answer

Click here to submit your answer.

0 Comments

Oldest

Newest Most Voted

Inline Feedbacks

View all comments

HAMROCSIT.COM

Question