This page is rarely updated. Some talks were done using the Flash technology. I have stopped it since the technology is becoming old, and Adobe has changed the rules for purchasing licenses. The future is certainly HTM5.

# Regular Cost Functions

Regular cost functions form a quantitative extensions to the notion of regularity which preserves several good properties of regular languages.

- A talk in pdf given at the conference dedicated to the scientific legacy of Marcel-Paul Schützenberger in Mars 2016.
- An introduction to regular cost functions given in Gudauri for TbiLLC’13 (27/09/2013) [swf].
- A tutorial (2h30) covering several aspects of the theory given at the Games-Epit spring school in Carcans-Maubuisson in May 2011 [swf].
- A talk on magnitude monadic logic given at the FREC-workshop in Ile de Ré (24/05/2013) [swf] (a very short introduction was given at highlights 2013 [swf])

Some other talks on the subject.

- An older presentation of distance automata and regular cost functions over words given in Oxford for GAMES (20-23/09/2010) [swf].
- A talk on regular cost functions over trees given at LICS 2010 (11/07/2010, Edinburgh) [swf].
- A talk, in french, on regular cost functions over trees, with a focus on Games, given in the ‘Journées Nationales du GDR Informatique Mathématique’ [pdf] (22/01/2010).
- The talk introducing regular cost functions over words given at ICALP 2009 (06/07/2009, Rhodos) [pdf].

Several important ideas concerning regular cost functions originates from a previous work on MSOB, an extension or monadic second-order logic with bounds.

- A talk on MSOB (monadic second order logic with bounds), given at LICS06 [pdf, ps.gz], and a longer variant given in Perugia and Liafa [pdf, ps.gz].

# The Monadic Theory of Linear Orderings

- A talk on the characterization of sublogics of MSO over countable linear orderings given for the working group ALGA (Paris, 30.03.15) [pdf].
- A talk on the monadic theory of the rational line (for Gandalf, June 2011, Minori) [swf].
- A talk on the monadic theory of the rational line with reals in the background (for CSR 2013 in Iekaterinburg) [swf].

# Data Languages and Automata with Atoms

- A talk given in Dagstuhl (]Nominal Computation Theory, October 14-16 2013) on the equivalence for data languages between recognition by orbit finite nominal monoids and definability in rigidly guarded monadic (second-order) logic (based on our joint paper with Clemens Ley and Gabriele Puppis at MFCS11) [swf].

# Factorization Forests

These works concern extensions of the theorem of forest factorization due to Imre Simon. This theorem has algebraic consequences, as well as applications in logics and formal language theory.

- A talk on factorization forests given for the workshop in honor of Bruno Courcelle, 18-20 June 2012 in Bordeaux [swf].
- A talk on deterministic factorization forests given in ICALP07 and in Dagstuhl (11.07) [pdf,ps.gz].
- The talk on factorization forests given for FCT07 [pdf,ps.gz].
- An introduction to factorization forests (in french) given at Irisa in Rennes [pdf, ps.gz].

# Some Surveys

- A talk on the notion of unambiguity given for DCFS in Waterloo, then 26.06.15 [pdf].
- A talk on the variants of the notion of determinism (for STACS 2012 in Paris) [swf].
- A talk on Green’s relations (for LATA 2011 in Tarragona) [swf].
- A survey talk on pebble automata given at Irisa in Rennes in October 2006 (in french) [pdf, ps.gz] (the informations are not up to date anymore).

# Various Other Subjects

- A talk on positional determinacy and its link with determinization of automata (for GAMES 2012 in Napoli) [swf]
- A proof of lower bound on the determinization of Büchi automata, given in Liafa [pdf] (02/04/2010). This is a long version of the talk given for ICALP 2009 (drawings due to Konrad Zdanowski).
- Positional determinacy over finite arenas – some steps toward – [pdf, ps.gz].
- A talk on (finite) set interpretations given in Szeged [pdf, ps].