A language recognized by a finite-state automaton. Of the language classes commonly studied, the class of regular languages is the smallest and mathematically the simplest. Its importance is shown by the existence of several alternative definitions; for some of them see linear grammar, Myhill equivalence, Nerode equivalence, regular expression, regular grammar, tree grammar.