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

Theory of computation miscellaneous

Theory of Computation

  1. If L1 = { an | n ≥ 0 } and L2 = { bn | n ≥ 0 } , consider
    (I) L1 .L2 is a regular language
    (II) L1 .L2 = {an bn | n ≥ 0}
    Which one of the following is CORRECT?
    1. Only (I)
    2. Only (II)
    3. Both (I) and (II)
    4. Neither (I) nor (II)
Correct Option: A

NA



Your comments will be displayed only after manual approval.