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

25 marca 2014 14:15
Olivier Serre (LIAFA, Paris)
Playing with Automata and Trees
Roughly speaking a finite automaton on infinite trees is a finite memory machine that takes as input an infinite node-labelled binary tree and processes it in a top-down fashion as follows. It starts at the …
19 marca 2014 14:15
Nathanaël Fijalkow (Uniwersytet Warszawski)
The value 1 problem for probabilistic automata
I will talk about probabilistic automata, which are automata assigning to each word a probability to be accepted. Specifically, I will be interested in the value 1 problem, which asks whether for a given probabilistic …
12 marca 2014 14:15
Joanna Ochremiak (Uniwersytet Warszawski)
Turing Machines with Atoms and Constraint Satisfaction Problems (joint work with Bartek Klin, Sławomir Lasota, Szymon Toruńczyk) - continuatio)
We study deterministic computability over sets with atoms. We characterize those alphabets for which Turing machines with atoms determinize. To this end, the determinization problem is expressed as a Constraint Satisfaction Problem, and a characterization …
5 marca 2014 14:15
Joanna Ochremiak (Uniwersytet Warszawski)
Turing Machines with Atoms and Constraint Satisfaction Problems (joint work with Bartek Klin, Sławomir Lasota, Szymon Toruńczyk)
We study deterministic computability over sets with atoms. We characterize those alphabets for which Turing machines with atoms determinize. To this end, the determinization problem is expressed as a Constraint Satisfaction Problem, and a characterization …
26 lutego 2014 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
Transducers with origin information
Call a string-to-string transducer regular if it can be realised by one of the following equivalent models: mso transductions, two-way deterministic automata with output, and streaming transducers with registers. In the talk, I will propose …
19 lutego 2014 14:15
Alessandro Facchini (Uniwersytet Warszawski)
Weak MSO: Automata and Expressiveness Modulo Bisimilarity (joint work with F. Carreiro, Y. Venema and F. Zanasi)
We prove that the bisimulation-invariant fragment of weak monadic second-order logic (WMSO) is equivalent to the fragment of the modal μ-calculus where the application of the least fixpoint operator μp.φ is restricted to formulas φ …
5 lutego 2014 14:15
Piotr Hofman (Bayreuth Universität)
Infinite-State Energy Games (joined work with Parosh Aziz Abdulla, Mohamed Faouzi Atig, Richard Mayr, K. Narayan Kumar and Patrick Totzke)
Energy games are a well-studied class of2-player turn based games on a finite graphwhere transitions are labelled with integer vectors which representchanges in a multidimensional resource (the energy). One player tries to keep the cumulative …
29 stycznia 2014 14:15
Denis Kuperberg (Uniwersytet Warszawski)
Regular Sensing (joint work with Shaull Almagor and Orna Kupferman)
The size of deterministic automata required for recognizing regular and omega-regular languages is a well-studied measure for the complexity of languages. We introduce and study a new complexity measure, based on the sensing required for …
22 stycznia 2014 14:15
Achim Blumensath (Technische Universität Darmstadt)
Recognisability and Algebras of Infinite Trees
In this talk I give an overview of an algebraic language theory for languages of infinite trees based on algebras called omega-hyperclones. Recognisability with respect to these algebras has the same expressive power as tree …
15 stycznia 2014 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
Weak MSO+U with path quantifiers
Over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths. The proof is by reduction to emptiness for a certain automaton model, while …
8 stycznia 2014 14:15
Eryk Kopczyński (Uniwersytet Warszawski)
Infinite sets in practice
We present a C++ library allowing computation over infinite sets. The programmer is able to represent infinite sets (in finite memory), as well as loop over them (in finite time). The elements of these sets …
18 grudnia 2013 14:15
Paweł Parys (Uniwersytet Warszawski)
Two-Way Cost Automata and Cost Logics over Infinite Trees (joint work with Achim Blumensath, Thomas Colcombet, Denis Kuperberg and Michael Vanden Boom)
This work is a step towards solving regular cost functions on infinite trees (which is already done for words - finite and infinite - and for finite words).We consider cost functions over infinite trees defined …
11 grudnia 2013 14:15
Michał Skrzypczak (Uniwersytet Warszawski)
Harrington's game and measurability of regular tree languages (joint work with Tomasz Gogacz, Henryk Michalewski and Matteo Mio)
I will present some investigations on measure properties of regular tree languages. The motivation for this research comes from the dissertation of Matteo Mio. I plan to focus on two aims: the first aim is …
4 grudnia 2013 14:15
Denis Kuperberg (Uniwersytet Warszawski)
Nondeterminism in the Presence of a Diverse or Unknown Future (joint work with Udi Boker, Orna Kupferman, Michał Skrzypczak)
One of the advantages of deterministic automata is that they composewell with trees and games. In the theory of cost functions, suchdeterministic automata are not always available, so a weaker notionwas introduced: history-deterministic automata, which …
27 listopada 2013 14:15
Adam Witkowski (Uniwersytet Warszawski)
Regular Tree Pattern Queries and Datalog
Regular Tree Pattern Queries (RTPQ) are queries for data trees that were defined during a research on Active XML.We found that this formalism is interesting on its own and closely connected to Datalog.I will talk …