ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > KEYWORD > STAR-FREE REGULAR LANGUAGES:
Reports tagged with star-free regular languages:
TR07-008 | 27th November 2006
Philipp Weis, Neil Immerman

Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words

It is well-known that every first-order property on words is expressible using at most three variables. The subclass of properties expressible with only two variables is also quite interesting and well-studied. We prove precise structure theorems that characterize the exact expressive power of first-order logic with two variables on words. ... more >>>



ISSN 1433-8092 | Imprint