You are not logged in |
Weekly research seminar
Organizers
- prof. dr hab. Mikołaj Bojańczyk
- prof. dr hab. Damian Niwiński
Information
Wednesdays, 2:15 p.m. , room: 5440Research fields
List of talks
-
Jan. 18, 2006, 2:15 p.m.
Filip Murlak (Uniwersytet Warszawski)
Games for the Wadge Hierarchy of Deterministic Tree Languages
In the case of infinite words, the hierarchy of regular languages defined by continuous reductions is well understood since Wagner's 1977 paper. In particular, there exists a procedure calculating the exact level of a given …
-
Dec. 14, 2005, 2:15 p.m.
Eryk Kopczynski (Uniwersytet Warszawski)
Half-positionally determined winning conditions in infinite games
We consider half-positionally determined winning conditions in infinite games played on a graph by two antagonistic players Eve and Adam. We call a winning condition W _positionally determined_ if, for every infinite game (G,W) using …
-
Dec. 7, 2005, 2:15 p.m.
Thomas Colcombet (Rennes) (Uniwersytet Warszawski)
Infnite games on finite graphs
We consider games played on an arena (a graph) by two antagonistic players. In such a game, each player, when there is its turn, chooses an edge to follow, originating in the current position. The …
-
Dec. 7, 2005, 2 p.m.
Thomas COLCOMBET (Uniwersytet w Rennes (Francja), CNRS)
Infinite games on finite graphs
Autorskie streszczenie wykladu: We consider games played on an arena (a graph) by two antagonistic players. In such a game, each player, when there is its turn, chooses an edge to follow, originating in the …
-
Nov. 30, 2005, 2:15 p.m.
Slawomir Lasota (Uniwersytet Warszawski)
One-clock timed automata
For timed automata with two clocks emptyness in decidable but universality and containment are not. We will show that all these problems are decidable for alternating timed automata, but with only one clock. The non-primitive-recursive …
-
Nov. 23, 2005, 2:15 p.m.
Slawomir Lasota (Uniwersytet Warszawski)
Complexity of bisimulation equivalence
An overview of known results and open problems in checking bisimulation equivalence on infinite graphs. In particular, graphs generated by context-free grammars and pushdown automata will be considered. Relationship to language equivalence will be pointed …
-
Nov. 18, 2005, 2:15 p.m.
Stephan Kreutzer (Uniwersytet Warszawski)
DAG-width and Parity Games
Tree-width is a well-known metric on undirected graphs that measures how tree-like a graph is and gives a notion of graph decomposition that proves useful in algorithm development. Tree-width is characterised by a game known …
-
Nov. 2, 2005, 2:15 p.m.
Hugo Gimbert (joint work with Wieslaw Zielonka)
Positional Payoff Games
I will present some results about the existence of positional optimal strategies in two-players antagonistic games and of positional Nash equilibria in multiplayer games
-
Oct. 19, 2005, 2:15 p.m.
Damian Niwinski (joint work with T. Knapik, P. Urzyczyn, and I. Walukiewicz) (Uniwersytet Warszawski)
Model checking of panic automata
Panic automata, invented by Pawel Urzyczyn, extend the concept of 2nd order pushdown automata (with stacks of stacks), by a destructive move called panic. They are in a sense equivalent to 2nd order tree grammars. …
-
Oct. 5, 2005, 2:15 p.m.
Mikolaj Bojanczyk (joint with Igor Walukiewicz) (Uniwersytet Warszawski)
Unranked Tree Algebra
I will present an algebra for recognizing languages of unranked, finite trees. This algebra is a special case of a transformation semigroup. The talk will focus on analyzing algebras that correspond to languages defined in …
