Automata for words and trees over infinite alphabet
Henrik Björklund, University of Umeå
- Date and Time
Monday, February 1st, 2010 at 13.30
Polacksbaken, room 1146
In recent years, extensions of classical formal language theory to words and trees over infinite alphabets have recieved considerable attention. This interest is motivated by applications in parameterized verification and in XML processing. In this talk, we look at a toy example of how a verification task can be modeled with automata for words over infinite alphabets. We also compare two different automata classes for such languages and, lastly, see how one of them can be generalized to work on bounded depth trees.