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

Theory of computation miscellaneous

Theory of Computation

  1. Consider the languages:
    L1 = {WWR | W ∈ {0, 1)*}
    L2 = {W #WR | W ∈ {0, 1)*} where # is a special symbol
    L3 = {W W| W ∈ {0, 1)*}
    Which one of the following is true?
    1. L1 is a deterministic CFL
    2. L2 is a deterministic CFL
    3. L3 is a CFL but not a deterministic CFC
    4. L3 is a deterministic CFL
Correct Option: B

In all the options there is linear relationship among strings so all CFL' s, but L1 & L3 can be accepted by PDA, L2 can be accepted by deterministic CFL due to presence of special symbol D which tells the middle of the string, so deterministic.



Your comments will be displayed only after manual approval.