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

Theory of computation miscellaneous

Theory of Computation

  1. Which of the following languages is generated by the given grammar?
    1. S → aS | bS | ε
    2. {an bm | n , m ≥ 0}
      {w ∈ {a, b}*| w has equal number of a 's and b 's}
    3. {an | n ≥ 0} ∪ {bn | n ≥ 0} ∪ {an bn |n ≥ 0}
    4. {a,b}*
Correct Option: D

NA



Your comments will be displayed only after manual approval.