You are not logged in |
Unambiguous tree languages
- Speaker(s)
- Marcin Bilkowski
- Affiliation
- Uniwersytet Warszawski
- Date
- May 27, 2009, 2 p.m.
- Room
- room 2080
- Seminar
- Seminar Automata Theory
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.
