Finite automata are classical machines that recognise regular languages. However, many other devices characterising this class are known. These alternative models may represent regular languages in a significantly more concise way than classical recognisers. In this talk I will present an overview of old and recent results on formal systems for regular languages from a descriptional complexity point of view, that is by considering the relationships between the sizes of such devices.