Automata-Theoretic Method

A technique that reduces logical decision problems to questions about finite or infinite automata and the language-theoretic properties of the languages those automata accept, using effective translations between formulas/models and automata so that satisfiability, validity, or model-checking reduces to emptiness, inclusion, or acceptance problems for automata.