University of Birmingham > Talks@bham > Theoretical computer science seminar > Zigzag games, alternating infinite word automata and linear Monadic-Second order logic

Zigzag games, alternating infinite word automata and linear Monadic-Second order logic

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact George Kaye.

Zoom details


(Joint work with Colin Riba)

Automata theory over infinite word is typically connected to logic through Büchi’s decidability theorem, which assert that ω-regular languages correspond exactly to denotations of formulas in Monadic Second-Order (MSO) logic over the structure (ω, <) ( MSO ). This correspondance yields Büchi’s celebrated ‘62 theorem that states that MSO is decidable, which has since then been extended in many directions.

One natural question is to ask about constructive variants of MSO ; for instance, to the best of my knowledge, it is unknown whether the MSO theory (restricted to decidable sets for the second-order part) in the effective topos is decidable, or if it is distinct from the theory obtained by considering type-2 realizability.

With Colin, we investigated a much simpler issue, partially motivated by extraction algorithms for finite-state synchronous transducers (Mealy machines). We gave a theory LMSO , refining MSO , tailored to enable the extraction of Mealy machines from ∀∃ statements through a straightforward realizability-like interpretation. In this talk I will discuss that theory, how the Büchi logic-automata correspondence is refined using the language of linear logic and its similarities with linear Dialectica.

(While this talk mentions automata theory and linear logic (and Dialectica), I would like to stress that the connection made here is apparently not the same as the one explored in Tito’s talk the previous week.)


This talk will be chaired by Anupam Das.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.