Consider the languages L1 = {a^nb^nc^m|n, m > 0} and…


Consider the languages
L1 = {a^nb^nc^m|n, m > 0} and L2 = {a^nb^mc^m|n, m > 0}
Which one of the following statements is false?
a. L1 ∩ L2 is a CFL
b. L1 ∪ L2 is a CFL
c. L1 ∪ L2 is inherently ambiguous
d. L1 ∩ L2 is a CSL

Ravi Garg edited question
    Sonali Kapoor (anonymous)

    correct option A

    Sonali Kapoor answered
      Uma Mehta (anonymous)

      mam pls explain it

      Uma Mehta answered
        Sonali Kapoor (anonymous)

        intersection of L1 and L2 will be “a^nb^nc^n”.. which is CSL … hence not CFL…. therefore A is false

        Sonali Kapoor answered
          Add image to editor add image from link

          Question stats

          • Active
          • Views624 times
          • Answers3 answers
          • Followers1 follower
          Question and answer is powered by AnsPress