The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
49 views
THE MINIMAL FINITE AUTOMATA THE STRING IN R=0*1*______STATES.
asked in Theory of Computation by (61 points) | 49 views
0

it should be $3$ states

1 Answer

+2 votes
Minimum state is 3
answered by (49 points)
edited by
0
should be $3$ states
0
show the DFA.
0
see above ..commented in question
0
whenever the question is about minimal finite automata we should go with NFA, in this case it is so happened that number of states in minimal DFA and NFA both are same, but it is not the case always!
0
Minimum state is 3
0
Yes you are right.


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

38,053 questions
45,545 answers
131,864 comments
48,885 users