Let L1 = {w ? {0,1}? | w has at least as many occurrences of (110) 's as (011) 's}. Let L2 = { ? {0,1}? | w has at least as many occurrences of (000) 's as (111) 's}. Which one of the following is TRUE?
A) L1 is regular but not L2
B) L2 is regular but not L1
C) Both L1 and L2 are regular
D) Neither L1 nor L2 are regular
Correct Answer:
Verified
Q2: A spanning tree for a simple graph
Q3: If G is a simple connected 3-regular
Q4: If G is a connected planar graph
Q5: A Hamiltonian cycle in a Hamiltonian graph
Q6: If G is a simple connected 3-regular
Q7: The following grammar
G = (N, T, P,
Q8: The following grammar
G = (N, T, P,
Q9: The following grammar
G = (N, T, P,
Q10: P, Q, R are three languages. If
Q11: Which of the following is true with
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