You are not logged in |
Two-way temporal logic over unranked trees
- Speaker(s)
- Mikołaj Bojańczyk
- Affiliation
- Uniwersytet Warszawski
- Date
- Nov. 29, 2006, 2:15 p.m.
- Room
- room 5870
- Seminar
- Seminar Automata Theory
I will talk about languages of unranked trees that can be defined in a temporal logic with two operators: exists some ancestor, and exists some descendant. The point is to have an algorithm, which decides if a given regular tree language can be expressed by a formula of this logic.
