Find a regular description for the language recognized by theNFA with set of states {0,1,2,3,4,5}, initial state 0, acceptingstate 4, and transitions
δ(0,a)={1,3}, δ(0,b)=4, δ(1,a)=4, δ(1,b)={2,3}, δ(2,b)=5, δ(3,a)=2,δ(4,a)={0,5}, δ(4,b)={0,2}, δ(5,a)=4
Expert Answer
An answer will be send to you shortly. . . . .