Consider the regular language L =(111+11111) *. The minimum number of states in any DFA accepting this languages is:
A) 3
B) 5
C) 8
D) 9
Correct Answer:
Verified
Q1: Let SHAM3 be the problem of finding
Q2: Consider the following statements about the context
Q4: Give a production grammar for the language
Q5: The production Grammar is {S->aSbb,S->abb} is
A)type-3 grammar
B)type-2
Q6: Regular expression (x/y)(x/y) denotes the set
A){xy,xy}
B){xx,xy,yx,yy}
C){x,y}
D){x,y,xy}
Q7: The regular expression have all strings in
Q8: Suppose that a problem A is known
Q9: Which of the following assertions about Turing
Q10: A PC not connected to a network
Q11: Recursively enumerable languages are not closed under:
A)Union
B)Intersection
C)Complementation
D)Concatenation
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