I know that the language {w  {a, b}| |w|a = |w|b} is not regular since somehow, you can't store all the information needed in a DFA. I've seen that normally it's done with reduction to absurdity or pumping lemma and also having into consideration that the language a^nb^n is not regularBut I would like to see a formal approach of it to fully understand why and not only because of intuitionCould someone please help me? Most of examples just always show the same and I don't see how to apply them to my case.
Proof that {w  {a, b}  | |w|a = |w|b} is not a regular language
complexity theory;formal languages;regular languages;pumping lemma