Theory of Computation Regular Languages and Finite Automata Regular Languages

Consider the language L = {anbm ∶ n ≥ 4, m ≤ 3}

Which of the following regular expression represents language L?

1
aaaa*(λ + b + bb + bbb)
2
aaaaa*(b + bb + bbb)
3
aaaaa*(λ + b + bb + bbb)
4
aaaa*(b + bb + bbb)

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