Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars

Which of the following is/are Context Free Language?

1
L: {wanbnwR |w ϵ {a, b}*, n ≥ 0}
2
L: { an bm ak | k = mn and k, m, n ≥ 1 }
3
 L = {am |m ≥ 0} ∪ {ambm| m ≥ 0}
4
L: { am + n bn + m cm | n, m ≥ 1 }

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters