Organizatorzy

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

Informacje

środy, 14:15 , sala: 5050

Dziedziny badań

Lista referatów

25 marca 2009 14:15
Paweł Parys (joint work with Igor Walukiewicz) (Uniwersytet Warszawski)
Weak Alternating Timed Automata
Alternating timed automata on infinite words are considered. The main result is the characterization of acceptance conditions for which the emptiness problem for the automata is decidable. This result implies new decidability results for fragments …
25 marca 2009 14:15
Paweł Parys (Uniwersytet Warszawski)
Lower bound for computing fixed points
We consider the following problem: There is given a monotone K-argument function f defined on N-bit sequences {0,1}^N. There is also given the following simpliest possible mu-calculus expression: mi(x1).ni(x2).mi(x3).ni(x4)...mi(xK).f(x1,...,xK). The function is given as a …
18 marca 2009 14:15
Wojciech Czerwiński (joint work with Sławomir Lasota) (Uniwersytet Warszawski)
Partially Commutative Context Free Processes
I will talk about some new class of processes (transition systems) which could be useful for investigating properties of the Process Algebra (PA), a well known class of transition systems. In particular I will show …
11 marca 2009 14:15
Mikołaj Bojańczyk (joint work with Tomasz Idziaszek and Wojciech Czerwiński) (Uniwersytet Warszawski)
Forest algebra for infinite forests
I will talk about an extension of forest algebra for ω-forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc) extend to the inﬁnite case. To prove its usefulness, I will …
4 marca 2009 14:15
Szymon Toruńczyk (joint work with Mikołaj Bojańczyk) (Uniwersytet Warszawski)
Min-regular languages
A new class of languages of inﬁnite words is introduced, called the min-regular languages, extending the class of omega-regular languages. Min-regular languages are somehow dual to max-regular languages introduced before. The class has two equivalent …
25 lutego 2009 14:15
Paweł Parys (Uniwersytet Warszawski)
Lower bound for computing fixed points
We consider the following problem: There is given a monotone K-argument function f defined on N-bit sequences {0,1}^N. There is also given the following simpliest possible mu-calculus expression: mi(x1).ni(x2).mi(x3).ni(x4)...mi(xK).f(x1,...,xK). The function is given as a …
18 lutego 2009 14:15
Łukasz Kaiser (Aachen)
Basic Analysis of Structure Rewriting Systems
A single state of an analyzed system has, in practice, often a complex structure in itself, while in theory it is usually simple in some sense, e.g. it can be a tree. We show how …
21 stycznia 2009 14:15
Henryk Michalewski (Uniwersytet Warszawski)
Complete pairs of coanalytic sets
10 stycznia 2009 14:15
Robert Dąbrowski (Uniwersytet Warszawski)
Introducing equations in free semigroup
Let be given a free monoid with a set of generators E whose cardinality is at least 2. We shall call elements of E 'letters' and elements of E* 'words'. Let also be given a …
6 stycznia 2009 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
A geometrical approach to star height
I will talk about an algorithm deciding limitedness of distance desert automata (which is the hard part in deciding star height). The algorithm itself is quite simple, and the correctness argument involves concepts such as …
10 grudnia 2008 14:15
Tomasz Idziaszek (Uniwersytet Warszawski)
EF logic
I will talk about a simple temporal logic EF over finite words, infinite words and finite trees. I will show that a language is definable by an EF formula if and only if its syntactic …
3 grudnia 2008 14:15
Leszek Kołodziejczyk (Uniwersytet Warszawski)
Parity games in weak arithmetic theories
Parity games in weak arithmetic theories I will present A. Beckmann and F. Moller's paper "On the complexity of parity games". The main result of the paper is that positional determinacy of parity games can …
26 listopada 2008 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
The star-height problem
5 listopada 2008 14:15
Tomasz Jurdziński (Wrocław)
Leftist grammars
Leftist grammars were introduced as a tool to show decidability of the accessibility problem in certain general protection systems. In the presentation, I will concentrate on complexity of the membership problem for these grammars and …
22 października 2008 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
Max-regular languages (cont.)