Question

which of the technique can be used to prove that a language is non regular

Answer 1

Answer:

We use the powerful technique called Pumping Lemma, for showing certain languages not to be regular. We use Ardens theorem to find out a regular expression out of a finite automaton.