Organizatorzy

prof. dr hab. Mikołaj Bojańczyk
prof. dr hab. Damian Niwiński

Informacje

środy, 14:15 , sala: 5440

Dziedziny badań

Lista referatów

9 maja 2007 14:15
Anna Niewiarowska
Probalistically Checkable Proofs and approximation hardness
The PCP theorem states that for each NP language there is a verifier that checks membership proofs probabilistically, using only logaritmic number of random bits and reading constant number of proof bits. I will show …
25 kwietnia 2007 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
Forest expressions
I will talk about a type of regular expression for unranked trees. The main focus is on connections with logic: the expressions correspond to chain logic, the star-free expressions correspond to first-order logic, and finally, …
18 kwietnia 2007 14:15
Konrad Zdanowski (Uniwersytet Warszawski)
Undecidability methods for the word problem in finite semigroups
3 kwietnia 2007 14:15
Damian Niwiński (Uniwersytet Warszawski)
Two remarks on the role of ranks in parity games
These observations are of very different nature, but they can be read as evidences for the lower bound, and the upper bound, respectively. At first we show that the number of ranks gives rise to …
21 marca 2007 14:15
Filip Murlak (Uniwersytet Warszawski)
Temporal Logics and Model Checking for Fairly Correct Systems
I will present recent results on model checking for fairly correct systems (D. Varacca, H. Voelzer, LICS'06). A fair variant of a specfication is obtained by replacing "for all paths" by "for a large set …
14 marca 2007 14:15
Pawel Parys (Uniwersytet Warszawski)
On Systems of Equations Satisfied in All Commutative Finite Semigroups
I show the algorithmic procedure for solving the problem: check if a system of equations has a solution in every commutative finite semigroup.
28 lutego 2007 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
A paradox for CTL
The property "every path belongs to (ab)*a(ab)*" can be expressed in CTL; but necessarily using existential modalities. This shows that ACTL;does not capture the common fragment of CTL and LTL.
3 stycznia 2007 14:15
Maria Fraczak (Uniwersytet Warszawski)
Defining rational functions by deterministic pushdown transducers
Rational functions are partial functions from words to words. They are implemented by finite state automata extended to produce output; only some of them can be realized by deterministic pushdown transducers (deterministic pushdown automata producing …
20 grudnia 2006 14:15
Sławomir Lasota (Uniwersytet Warszawski)
Bisimulation equivalence and commutative context-free grammars
The topic will be the class of processes (transition systems) generated from the commutative context-free grammars. I will present a method enabling to prove decidability (and to compute the complexity) of different variants of bisimulation …
29 listopada 2006 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
Two-way temporal logic over unranked trees
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 …
23 listopada 2006 14:15
Marcin Jurdziński (Uniwersytet Warszawski)
Subexponential algorithms for solving parity games
Solving parity games is polynomial time equivalent to the modal mu-calculus model checking problem and its exact computational complexity is an intriguing open problem: it is known to be in UP (unambiguous NP) and co-UP, …
15 listopada 2006 14:15
Filip Murlak (Uniwersytet Warszawski)
Weak automata and Wadge hierarchy
I will show a new lower bound for the height of the Wadge hierarchy of weak tree languages, i. e., the languages of infinite trees recognizable with weak automata. To this end I will prove …
25 października 2006 14:15
Jacek Jurewicz (Uniwersytet Warszawski)
Panic automata
Panic automata are an extension of second-order pushdown automata (that operate on a second-order pushdown store, ie. a stack of stacks) by the destructive "panic" operation introduced by P. Urzyczyn in order to fully relate …
11 października 2006 14:15
Eryk Kopczynski (Uniwersytet Warszawski)
Half-positionally determined winning conditions
Basic definitions: games, half-positional determinacy. - Half-positional winning conditions and omega-regular languages. How to check whether the given omega-regular winning condition is finitely half-positional? - Positional/suspendable conditions (PS). Definitions and examples. Half-positional determinacy of a …
4 października 2006 14:15
Henrik Bjorklund (Dortmund)
Toward Regular Data Languages