1,203 views

1 Answer

1 votes
1 votes
I strongly believe u really want to use state elimination method for this . if u want to learn u can google it out and apply .

the best and efficient way is the option elimination method . it works , fast.

1- take option 1 and 4 and make the start term null. as we can take it any number of time . i will take it zero time .

now only 01 remains . and 01 is not accepted,

now check for 2 and 3 u will get 2 as answer

Related questions

0 votes
0 votes
0 answers
1
Rhythm asked Feb 22, 2019
392 views
I found out its regular expression to be00(0+11*0+11*10)*11*is this regular expression correct for the finite automata given above?
1 votes
1 votes
1 answer
2
Dhananjay15 asked Aug 19, 2018
1,638 views
What is the RE for the above FA?
0 votes
0 votes
0 answers
3