Consider the regular language L =(111+11111) *. The minimum number of states
A) 3
B) 5
C) 8
D) 9
Correct Answer:
Verified
Q14: If s is a string over (0
Q15: For S € (0+1)* let d(s)denote the
Q16: Let SHAM3 be the problem of finding
Q17: Consider the following statements about the context
Q18: Let L1 be a regular language, L2
Q20: Consider the languages: GATE[2005]L1 = {wwR w
Q21: Consider the languages: L1 ={a^n b^n c^m
Q22: Let L1 be a recursive language, and
Q23: Consider the following two problems on undirected
Q24: Let L1 be a recursive language. Let
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