Tata Institute of Fundamental Research
Logics and Automata for Classical and Real Time Unambiguous Languages
Synopsis Seminar
Speaker:
Simoni S. Shah
Organiser:
John Barretto
Date:
Tuesday, 17 Apr 2012, 16:00 to 17:30
Venue:
A-414 (A-Block Conference Room)
(Scan to add to calendar)
Abstract:
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[
| Speaker: | Simoni S. Shah |
| Organiser: | John Barretto |
| Date: | Tuesday, 17 Apr 2012, 16:00 to 17:30 |
| Venue: | A-414 (A-Block Conference Room) |
(Scan to add to calendar)
Abstract:
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[
Unambiguous star-free regular languages (UL) originally introduced by Schutzenberger, have various characterizations within classical logics (FO2[