Register

Min DFA states?

2,575 views
1 1 vote
Consider the regular language L=(00+0000)* . The minimum number of  states in any DFA accepting this languages is?

1 Answer

–1 –1 vote

Here L = (00+0000)*

means L = {ε, 00, 0000, 000000, ......}

Minimum no. of states for DFA = 4

Voting & Accepting an answer helps improve the community
← Previous · Optimal Merge Patter...Next → · degital logic desigi...
← Previous in category · #TOC #PeterlinzNext in category → · Find Regular Express...
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
2.2k
2.2k views
Amit Sharma asked Jun 7, 2016
2,150 views
Min No of states in FA .
L =Set of all string which starts with a and ends with a .what will be the min no of states in FA represented by this Lang.
0 0 votes
0 0 answers
656
656 views
hacker16 asked Dec 17, 2017
656 views
No of states in Min DFA
No of states in Min DFA, that accepts (1)* over {0,1} alphabets is1 states2 statesNone of these
0 0 votes
0 0 answers
6.2k
6.2k views
VikramRB asked Jan 5, 2019
6,186 views
[AppliedCourse Test] Min DFA of (a*b*) complement
The Minimum DFA that accepts the given language is ____L = { w | w is any string not in a*b*}