in Theory of Computation
128 views
0 votes
0 votes
How to convert (a+b)* into a minimal Dfa
in Theory of Computation
by
128 views

2 Comments

Do you know some theory on How we can convert regular expression to dfa ?
1
1
If  ∑ ={ a,b} , then it is none other than ∑* . which contains all the strings . Just need one state which is final and also initial state .
1
1

1 Answer

0 votes
0 votes
one state initial as final with self loop

Related questions