First-order logic and aperiodic languages: a revisionist history
@article{STRA18, abstract = {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!}, address = {New York, NY, USA}, author = {Straubing, Howard}, doi = {10.1145/3242953.3242956}, issue_date = {July 2018}, journal = {ACM SIGLOG News}, month = {jul}, number = {3}, numpages = {17}, pages = {4–20}, publisher = {Association for Computing Machinery}, sha256 = {41AE3789730E30BAEBD3E089D08CFA71139E99F06CD3491989F17A4809E6981D}, title = {First-order logic and aperiodic languages: a revisionist history}, url = {https://doi.org/10.1145/3242953.3242956}, volume = {5}, year = {2018} }