Interactions, automata, and names

Pisa, December 3 to December 14 2012.
The main references for the course are

• Kaminski, Tan: Regular Expressions for Languages over Infinite Alphabets. Fundam. Inform. 69(3): 301-318 (2006)
• Kaminski,Francez: Finite-Memory Automata. TCS 134(2): 329-363 (1994)
• Tzevelekos: Fresh-register automata. POPL 2011: 295-306
• Ciancia, Tuosto, Tzevelekos: The Languages of History-Dependent Automata. Manuscript available here
• Kurz, Suzuki, Tuosto: On Nominal Regular Languages with Binders. FOSSACS 2012, LNCS 7213: 255-269
• Kurz, Suzuki, Tuosto: A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions. IFIP TCS 2012, LNCS 7604: 193-208

The questions for the final exams are here.