Finite-state automata are theoretical computing machines used to recognize and manipulate regular languages.