automata-theory Definition Accepted Language The accepted language of an automaton over alphabet is the set of all strings that the automaton accepts, i.e. strings for which has a successful run according to its acceptance criterion. It’s denoted as .