First-order logic and aperiodic languages
Howard Straubing · ACM SIGLOG News · 2018
A fundamental result about formal languages states: Theorem 1 A regular language is first-order definable if and only if its syntactic monoid contains no nontrivial groups. Rest assured, we will explain in the next section exactly what the various terms in the statement mean!