First-order logic and aperiodic languages

Autor:	Howard Straubing
Rok vydání:	2018
Předmět:	Microbiology (medical) Algebra Rest (physics) Statement (computer science) Regular language Computer science If and only if Immunology Formal language Section (typography) Syntactic monoid Immunology and Allergy First-order logic
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
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e2943ad46578e4ae71e035821b74ec35 https://doi.org/10.1145/3242953.3242956 Zobrazit plný text záznamu