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

17 lutego 2010 14:15
Szymon Toruńczyk (Uniwersytet Warszawski)
Automata based veriﬁcation over linearly ordered data domains (joint work with Luc Segouﬁn)
In this paper we work over linearly ordered data domains equipped with ﬁnitely many unary predicates and constants. We consider nondeterministic automata processing words and storing ﬁnitely many variables ranging over the domain. During a …
27 stycznia 2010 13:00
Szczepan Humel & Paweł Parys (Uniwersytet Warszawski)
Topological Complexity of omega-BS regular languages (joint work with Szymon Toruńczyk) & Evaluation of normalized mu-calculus formulas is polynomial for fixed structure size)
Szczepan 13.00Bojańczyk and Colcombet have recently introduced new classes of omega languages, \omega B-, \omega S- and \omega BS-regular languages. All those classes can be characterized by counter automata with different acceptance conditions or by …
20 stycznia 2010 14:15
Brak
Nie ma seminarium
W najbliższą środę, nie ma seminarium.
13 stycznia 2010 14:15
Damian Niwiński (Uniwersytet Warszawski)
On the Borel complexity of MSO definable sets of branches (joint work with Alexander Rabinovich and Adam Radziwonczyk-Syta)
What sets of infinite words can be defined by means of MSO formulas interpreted in a binary tree, if we additionally allow some monadic predicates over the nodes ? We show that topologically these languages …
6 stycznia 2010 14:15
Tomasz Idziaszek (Uniwersytet Warszawski)
Single-Type Approximations of Regular Tree Languages
XML Schema Definitions can be adequately abstracted by the single-type regular tree languages, which form a strict subclass of regular unranked tree languages. Sadly, in this respect, XSDs are not closed under the basic operations …
16 grudnia 2009 14:15
Konrad Zdanowski (Uniwersytet Warszawski)
part 2 / A Tight Lower Bound for Determinization of Transition Labeled Buchi Automata (joint work with Thomas Colcombet)
We present a lower bound for the problem of translating a Buchi word automaton into a deterministic Rabin word automaton when both the Buchi and the Rabin conditions label transitions rather than states. This lower …
9 grudnia 2009 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
Query Width (joint work with Slawomir Lasota)
Query Width is a complexity measure, like Tree Width, or Clique Width. The difference is that Tree Width or Clique Width measure the complexity of a graph, while Query Width measures the complexity of a …
2 grudnia 2009 14:15
Konrad Zdanowski (Uniwersytet Warszawski)
part 1/ A Tight Lower Bound for Determinization of Transition Labeled Buchi Automata (joint work with Thomas Colcombet)
We present a lower bound for the problem of translating a Buchi word automaton into a deterministic Rabin word automaton when both the Buchi and the Rabin conditions label transitions rather than states. This lower …
25 listopada 2009 14:15
Marcin Dziubinski (Uniwersytet Warszawski)
Location games on multiple disjoint spaces: circles and lines. (joint work with Jaideep Roy and Debabrata Datta)
Location games are games where players select a subsets of points of some space, determining the division of this spaces into areas of points that are closer to the points of one of the players …
18 listopada 2009 14:15
Paweł Parys (Uniwersytet Warszawski)
Algorithm computing Simon decomposition in polynomial time
Simon decomposition is a very important tool in the finite monoid theory. I will present a new, efficient construction of the Simon decomposition. All previous constructions were starting from a finite monoid. When we have …
4 listopada 2009 14:15
Filip Murlak (Uniwersytet Warszawski)
Consistency of XML Schema Mappings (joint work with Shunichi Amano and Leonid Libkin)
Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amount of attention. I will present an attempt to develop …
28 października 2009 14:15
Diego Figueira (Laboratoire Spécification et Vérification (LSV))
Huge lower bounds of weak logics for data words
I will show how to code very hard problems into the satisfiability of the linear temporal logic (LTL) equipped with one register to store and test data values from positions of a data word. I …
21 października 2009 14:15
Eryk Kopczyński (Uniwersytet Warszawski) (Uniwersytet Warszawski)
Languages over Commutative Alphabets (part 2)
We consider languages accepted by non-deterministic finite automata and context-free grammars, except that we treat the language in a commutative way: we do not care about the order of letters in the accepted word, but …
14 października 2009 14:15
Eryk Kopczyński (Uniwersytet Warszawski)
Languages over Commutative Alphabets
We consider languages accepted by non-deterministic finite automata and context-free grammars, except that we treat the language in a commutative way: we do not care about the order of letters in the accepted word, but …
7 października 2009 14:15
Wouter Gelade (Hasselt)
Dynamic Complexity of Formal Languages
We will discuss the dynamic complexity of formal languages. As opposed to static complexity theory, which investigates the complexity of problems over fixed structures, dynamic complexity theory concerns the complexity necessary to maintain the answer …