Automata Theory

Natural & Formal Sciences Dictionary
The mathematical study of abstract machines (automata) and the classes of formal languages they recognize, including finite automata, pushdown automata, linear-bounded automata, and Turing machines; connects algebraic, logical, and combinatorial properties of languages and computational models.