Regular languages are a class of languages that can be expressed through regular expressions or finite automata.