Deterministic Logics for UL
Paritosh K. Pandya, Simoni S. Shah · arXiv (Cornell University) · 2014
The class of Unambiguous Star-Free Regular Languages (UL) was defined by Schutzenberger as the class of languages defined by Unambiguous Polynomials. UL has been variously characterized (over finite words) by logics such as TL[X_a,Y_a], UITL, TL[F,P], FO2[