4 Consider Language L B B X 0 E B 5 Marks Show Language Regular Language B 5 Marks Show Q43801634
Context-Free Languages
Could someone help me with this please.
![4. Consider the language L = {a*b*a*b* |x> 0}, where E = {a, b}. a. [5 marks] Show that this language is not a regular langua](https://media.cheggcdn.com/media/d4f/d4f02827-87b9-46dc-8f03-dfc18ab180a5/phptxJ9Mz.png)
4. Consider the language L = {a*b*a*b* |x> 0}, where E = {a, b}. a. [5 marks] Show that this language is not a regular language. b. [5 marks] Show that this language is not a context-free language. Show transcribed image text 4. Consider the language L = {a*b*a*b* |x> 0}, where E = {a, b}. a. [5 marks] Show that this language is not a regular language. b. [5 marks] Show that this language is not a context-free language.
Expert Answer
Answer to 4. Consider the language L = {a*b*a*b* |x> 0}, where E = {a, b}. a. [5 marks] Show that this language is not a regular l…
OR