Consider the regular language L = (111+111111) *. The minimum number of states inany DFA accepting this language is
A) 3
B) 5
C) 8
D) 9
Correct Answer:
Verified
Q19: Which of the statements is true:
A)The complement
Q20: The regular sets are closed under:
A)Union
B)Concatenation
C)Kleene closure
D)All
Q21: Any given transition graph has an equivalent:
A)regular
B)DFSM
Q22: A language is regular if and only
Q23: Which of the following is not a
Q25: How many strings of length less than
Q26: Which of the following is TRUE?
A)Every subset
Q27: The minimum state automaton equivalent to the
Q28: Which one of the following languages over
Q29: Let w be any string of length
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents