A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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[<], the variety DA of monoids, as well as partially-ordered two-way DFA (po2DFA). We revisit this language class with emphasis on notion of unambiguity and develop on the concept of Deterministic Logics for UL. The formulas of deterministicarXiv:1401.2714v1 fatcat:sxy5uh6fsncr7a46meb2eck6hq