University of Birmingham > Talks@bham > Theoretical computer science seminar >  Automata over infinite alphabets

Automata over infinite alphabets

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

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.

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.