What is a regular language of data words?

Prelegent(ci)

Mikołaj Bojańczyk

Afiliacja

Uniwersytet Warszawski

Termin

30 kwietnia 2008 14:15

Pokój

p. 5870

Seminarium

Seminarium „Teoria automatów”

---

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.

---