1. Engineering
  2. Computer Science
  3. pumping lemmas prove...

Question: pumping lemmas prove...

Question details

Pumping Lemmas Prove

Pumping lemmas (a) Prove that the language {wtttulu,te Σ*} is not regular. (b) Prove that the language {aba3nba2n) is not context-free.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution