retagged by
15,661 views

6 Answers

Answer:

Related questions

38 votes
38 votes
5 answers
1
Akash Kanase asked Feb 12, 2016
15,801 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