i had troubles proving this is not regular using the pumping lemma {$a^ib^jc^k : j = i \lor j = k$}. Not sure how to approach this anymore, and help would be appreciated
Asked
Active
Viewed 513 times
1 Answers
0
If you intersect your language with $a^+ b^+$ then you get $\{ a^n b^n : n \ge 1 \}$, whose irregularity you probably know how to prove.
Yuval Filmus
- 280,205
- 27
- 317
- 514