How to prove that a given language is not regular?

29 Views Asked by At

Let $L$ be the set of all words over $\{a,b\}$ in which the number of $b$'s are exactly double of $a$'s. How can one show that $L$ is not a regular language?