in Theory of Computation
130 views
0 votes
0 votes
How many number of states are there in the minimized dfa that accepts the language L= a^ 3(n+1)
in Theory of Computation
by
130 views

1 comment

moved by
for n>=0

L={a^3,a^6,a^9...............}

dfa will have 4states. (one a from last state will goto 2nd state)
0
0

1 Answer

0 votes
0 votes

4 state is required.

Related questions

0 votes
0 votes
1 answer
3