# Theory Of Computation Test – Question 14

Consider the following languages.

1. $L_1&space;=&space;\left&space;\{&space;a^*b^*\,&space;\right&space;\}$

2. $L_2&space;=&space;\left&space;\{&space;w\,\,\,|\,\,w\in&space;\left&space;\{&space;a,b&space;\right&space;\}^*,&space;n_a(w)&space;=&space;n_b(w)&space;\right&space;\}$

3. $L&space;=&space;\left&space;\{&space;a^mb^nc^n\,\,|\,\,m,n\geq1&space;\right&space;\}\cup&space;\left&space;\{&space;b,c&space;\right&space;\}^*$

Which of the above languages Satisfy Pumping lemma for Regular languages?

• 1.
• 2.
• 3.
• 4.