You are not logged in |
Monadic MSO logic
- Speaker(s)
- Bartek Klin
- Affiliation
- Uniwersytet Warszawski
- Date
- April 15, 2020, 2:15 p.m.
- Information about the event
- Online seminar
- Seminar
- Seminar Automata Theory
The correspondence of regular languages and monadic second-order logic relies on the fact that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for finite words, but also for infinite words, finite or infinite trees, and more generally for a wide range of monads. However, it does not hold always, and a structural characterization of those monads for which it does hold seems elusive. I will focus on a few examples to illustrate how subtle the condition can be.
