Regular expressions and finite automata are equivalent in their descriptive power.

Non-regular languages. Pumping lemma for regular languages. (Sipser's book, Section 1.4)
Some exercises on regular expressions.

Context-free languages and grammars (Sipser's book, Section 2.1)