Computer Science, asked by taiwoakinbodunwa, 1 year ago

Draw an ENFA that accept the following regular expression /languages
1. (a|b)*c
2.(aaa) */aa*
3.a*(a|b)
4.(a|b)*(abb/a+b)
5.(a|b)*(aa/bb)(a|b)*

Answers

Answered by zoyaaa786
1
5.............................
Similar questions