You are not logged in |
What is a regular language of data words?
- Speaker(s)
- Mikołaj Bojańczyk
- Affiliation
- Uniwersytet Warszawski
- Date
- April 30, 2008, 2:15 p.m.
- Room
- room 5870
- Seminar
- Seminar Automata Theory
It is impossible to define an automaton model for data words that would simultaneously satisfy several reasonable requirements, such as closure under boolean operations, decidable emptiness, etc. I will present some attempts that have appeared to this day, and compare their relative shortcomings.
