Regular languages exhibit considerable structure. The characterization of various classes of regular languages using classical and temporal logics, automata and varieties of monoids, as an attempt towards unification of diverse frameworks, has been an important theme and area of research for many decades. In this thesis, we investigate logic-automata connections for unambiguous languages over finite words and also timed words.
Unambiguous star-free regular languages (UL) originally introduced by Schutzenberger, have various characterizations within classical logics (FO2[
