Non-Regular Language, Pumping Lemma

[Fatima Hasan]

Homework Statement

Prove that $L$ is non-regular language.

2. Homework Equations
none

The Attempt at a Solution

So L is non-regular !
Is my solution correct?

 

[tnich]

Homework Statement

Prove that $L$ is non-regular language.
View attachment 224379

2. Homework Equations
none

The Attempt at a Solution

View attachment 224375

View attachment 224376

View attachment 224377

View attachment 224378

So L is non-regular !
Is my solution correct?

It does appear to be correct. You could simplify it a little by noting that you only need one counter-example to prove a statement false.
Edit: I take that back. I think you are correct to consider all of the cases, since the pumping lemma says a way to divide S into xyz that satisfies the rest of the conditions exists.