First-order logic and aperiodic languages

Autor: Howard Straubing
Rok vydání: 2018
Předmět:
Zdroj: ACM SIGLOG News. 5:4-20
ISSN: 2372-3491
Popis: 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!
Databáze: OpenAIRE