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

30 kwietnia 2014 14:15
-
No seminar this week
23 kwietnia 2014 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
Star height via games
I will show a simplified proof of decidability for the star height problem. The simplified proof follows the same lines as the proof of Daniel Kirsten: first the star height problem is reduced to the …
16 kwietnia 2014 14:15
Michał Skrzypczak (Uniwersytet Warszawski)
Kolmogorov's R-sets and regular tree languages
R-sets, introduced in 1928 by Andrey Kolmogorov, were designed as a wide class of well-behaved sets that can be described in a constructible way. One of the crucial properties of this class is universal measurability …
9 kwietnia 2014 14:15
Michał Skrzypczak (Uniwersytet Warszawski)
Determinisation of History Deterministic Automata
A non-deterministic automaton is history deterministic if it is possible to resolve its choices in a way that depends only on the already read input. Such automata appear naturally in synthesis problems and qualitative models.One …
2 kwietnia 2014 14:15
Szymon Toruńczyk (Uniwersytet Warszawski)
Turing Machine with Atoms and Descriptive Complexity
We relate Turing Machines with Atoms to a certain logic over finite structures. As an application to Descriptive Complexity Theory, within a substantial class of relational structures including Cai-Fürer-Immerman graphs, we precisely characterize those subclasses …
26 marca 2014 14:15
Luc Dartois (LIAFA, Paris)
Adding Modular predicates
When considering classes of regular languages, it is a primordial question to be able to determine if a given language belongs to it. Over fragments of logic, this question has been largely studied since McNaughton-Papert …
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
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
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
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
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
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 …