Title
First-order logic and aperiodic languages: a revisionist history.
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!
Year
Venue
DocType
2018
SIGLOG News
Journal
Volume
Issue
Citations 
5
3
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Howard Straubing152860.92