Regular Expression

Question

Which of the following language is accepted by the following finite automata?
(a) (110)∗01 (b) 0+(1(11)∗10)+0
(c) 0+(1(11)∗101)+0 (d) (11+10)∗01 

Comments

Thanks for pointing it out. I've edited. Please check now, although I've checked, but you can check it.

---

aambazinga seems okk to me!

---

Ok. Thanks.

Answer 1

• DFA accept string 1100 . But in option non of regular expression genrate 1100 . So all option are wrong

 

 

Comments

Thank you very much

Answer 2

Yes each and every options are wrong.

Answer 3

string generated from option (A)=11001 does not reach to final state,so it is incorrect.

string generated from option (B)=1111110 does not reach to any final state so it's incorrect.

string generated from from option (c)=111101 does not reach to final state it;s is also incorrect.

string generated from option (D)=1101 does not reach to any state so it is also incorrect,

so,no any option is correct.