Test by Bikram | Theory of Computation | Test 2 | Question: 28

Question

What is the regular expression corresponding to the above DFA?

• A. $(01 + (00)^*1)^*$
• B. $0^*10^*$
• C. $(10 + 0(00)^* (1 + 01) )^*$
• D. $0(00)^*10^*$

Answer 1

A) fails on 1

B) fails on 1

C) pass

D) fails on 00010

Comments

will the machine accepts null also?

---

you mean epsilon ,....... yes it is accepting epsilon as starting state is the final state