Home » Theory of Computation » Theory of computation miscellaneous » Question

Theory of computation miscellaneous

Theory of Computation

  1. Let L1 = {w ∈ {0, 1}*| w has at least as many occurrences of (110)'s as (011)'s}. Let L2 = {w ∈ {0, 1}* | w has at least as many occurrences of (000)'s as (111)'s}. Which one of the following is TRUE?
    1. L1 is regular but not L2
    2. L2 is regular but not L1
    3. Both L1 and L2 are regular
    4. Neither L1 nor L2 are regular
Correct Option: A

L1 is regular but L2 is not



Your comments will be displayed only after manual approval.