Unambiguous tree languages

Prelegent(ci)

Marcin Bilkowski

Afiliacja

Uniwersytet Warszawski

Termin

27 maja 2009 14:15

Pokój

p. 5870

Seminarium

Seminarium „Teoria automatów”

---

I will talk about the class of unambiguous regular languages of trees. For every language in this class there exists an automaton that accepts this language and admits at most one successful run for every tree. I will show that not all regular languages on trees are unambiguous. I will also show a few classes of languages that are ambiguous.

---