retagged by
15,516 views

6 Answers

Best answer
55 votes
55 votes

All strings ending with $10$. So, we need $3$ states.

  1. From first state on $1$, we go to second state. 
  2. From second state on $0$ we go to third state.
  3. From third state on $0$ we go to first state and on $1$ we go to second state. 

Only third state is final. 

L = (0+1)*10 Minimal DFA will be as follows: 

edited by
2 votes
2 votes
atleast 3 states  require to for this regular expresssion.
.
1 votes
1 votes
Make NFA from given R.E and then convert it to DFA, you'll get Arjun Sir's DFA and Answer as 3 states!
Answer:

Related questions

38 votes
38 votes
5 answers
1
Akash Kanase asked Feb 12, 2016
15,610 views
The number of states in the minimum sized DFA that accepts the language defined by the regular expression.$(0+1)^{*} (0+1) (0+1)^{*}$is ________.
65 votes
65 votes
12 answers
2
55 votes
55 votes
5 answers
3
38 votes
38 votes
5 answers
4