in Theory of Computation
213 views
0 votes
0 votes
in Theory of Computation
213 views

1 comment

A dumb question $!$
0
0

2 Answers

0 votes
0 votes
2
0 votes
0 votes

Divisible by 'n' then no of states =n

No of final states =1 and non final states=n-1

So n-1=3-1=2 non final states