Automata over infinite alphabets

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

• Nikos Tzevelekos (Queen Mary University)
• Friday 27 February 2015, 16:00-17:00
• CS 245.

If you have a question about this talk, please contact Neel Krishnaswami.

While automata theory has traditionally been based on the model of an abstract machine operating on a finite alphabet of input symbols, this assumption can be unsatisfactory for a range applications where value domains cannot be reasonably bounded: from XML model-checking, to process modelling and the verification of name-generating code. This has recently lead to a surge of interest in automata over infinite alphabets, thus opening up a world of open problems and new results. The talk will look into these exciting developments with a specific focus on latest work driven by applications in modelling and verifying name-generating programs.

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

This talk is included in these lists:

• CS 245
• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.