Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata
Consider the following language:
L= {w ∈ { a, b, c }* : na(ω) + nb(ω) = nc(ω)}
L is
1
Context free but not linear
2
Not context free
3
Context free and linear
4
Linear