in Theory of Computation
347 views
0 votes
0 votes
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to
in Theory of Computation
347 views

2 Answers

1 vote
1 vote
Best answer

PFA the answer with description in the image attached below :

 

selected by
0 votes
0 votes

Related questions