Solved

Let L1 = {W ? {0,1}? | W Has at Least

Question 10

Multiple Choice

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:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q5: Which one of the following statement is

Q6: Grammars that can be translated to DFAs:<br>A)Left

Q7: Which of the following is true with

Q8: A language L is accepted by a

Q9: Type-1 Grammar is known as_<br>A)CFG<br>B)CSG<br>C)REGULAR<br>D)All

Q11: Regular expressions are<br>A)Type 0 language<br>B)Type 1 language<br>C)Type

Q12: Let w be any string of length

Q13: Consider the regular language L = (111+111111)*.

Q14: Which of the following is TRUE?<br>A)Every subset

Q15: Consider the following language L = {anbncndn