Organizers

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

Information

Wednesdays, 2:15 p.m. , room: 5440

Research fields

List of talks

June 5, 2019, 2:15 p.m.
Radosław Piórkowski (Uniwersytet Warszawski)
New pumping technique for 2-dimensional VASS
I will show that every run of 2-VASS allows some kind of pumping: in some cases just a straightforward adaptation of 1D pumping techniques is enough —such runs we call 'thin'. I will prove that …
May 29, 2019, 2:15 p.m.
Sylvain Schmitz (CNRS & ENS Paris-Saclay)
The Parametric Complexity of Lossy Counter Machines
The reachability problem in lossy counter machines is the best-known ACKERMANN-complete problem and has been used to establish most of the ACKERMANN-hardness statements in the literature. This hides however a complexity …
May 22, 2019, 2:15 p.m.
Karin Quaas (Universität Leipzig)
The Containment Problem for Unambiguous Register Automata
We investigate the complexity of the containment problem: given a register automaton A and an unambiguous register automaton B, is the language accepted by A contained in the language accepted by B? We prove that …
May 15, 2019, 2:15 p.m.
Grzegorz Fabiański (Uniwersytet Warszawski)
Progressive Algorithms for Domination and Independence
I will present an algorithm for the dominating set problem, which has the following features: -- is super-simple (and heuristic-like) -- has a provable polynomial running time on many structural graph classes (and beyond) -- …
May 8, 2019, 2:15 p.m.
Nathan Lhote (Uniwersytet Warszawski)
Computability and continuity of regular functions over ω-words
The class of regular functions from infinite words to infinite words is characterised by MSO-transducers, streaming ω-string transducers (transducers with registers) as well as deterministic two-way transducers with regular look-ahead. In their one-way restriction, the …
April 24, 2019, 2:15 p.m.
Filip Murlak (Uniwersytet Warszawski)
Finite Query Answering in Expressive Description Logics
Evaluating queries in the presence of background knowledge has been extensively studied in several communities. In database theory, it is known as query answering under integrity constraints: given a finite database instance and a set …
April 17, 2019, 2:15 p.m.
Szymon Toruńczyk (Uniwersytet Warszawski)
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic
I will present joint work with Thomas Zeume. In this work, we study a model of register automata over infinite trees with extrema constraints. Such an automaton can store elements of a linearly ordered domain …
April 10, 2019, 2:15 p.m.
Alexander Rabinovich (Tel Aviv University)
Degrees of Ambiguity of Büchi Tree Automata
An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is finitely (respectively, countable) ambiguous if for every input it has at most finitely (respectively, countable) many accepting …
April 3, 2019, 2:15 p.m.
Nir Piterman (Chalmers University of Technology)
Synthesis From Temporal Specifications
In this talk I will present the GR[1] approach to synthesis, the automatic production of designs from their temporal logic specifications. We are interested in reactive systems, systems that continuously interact with other programs, users, …
March 27, 2019, 2:15 p.m.
Wojciech Czerwiński (Uniwersytet Warszawski)
joint work with Georg Zetzsche (Towards Regular Separability of Vector Addition Systems)
I will present a general approach to regular separability in subclasses of vector addition systems. I will sketch the proofs of two new decidability results for regular separability: 1-VASS languages vs VASS languages and Z-VASS …
March 20, 2019, 2:15 p.m.
Joanna Ochremiak (CNRS, LaBRI, Bordeaux)
On the power of symmetric linear programs
We consider families of symmetric linear programs (LPs) that decide a property of graphs in the sense that, for each size of graph, there is an LP defining a polyhedral lift that separates the integer …
March 13, 2019, 2:15 p.m.
Marcin Przybyłko (Uniwersytet Warszawski)
On computing measures of open sets of trees
Since Gogacz et al. proved that regular languages of infinite trees are universally measurable, the problem of computing a measure of a given regular set became an appealing and, it seems, difficult problem. Up …
March 6, 2019, 2:15 p.m.
Mikołaj Bojańczyk (joint work with Szymon Toruńczyk) (Uniwersytet Warszawski)
Fixed dimension polynomial time
We describe a complexity class for sets with atoms, which contains problems on orbit-finite inputs like graph reachability, emptiness and minimisation for automata. The idea is that the algorithm must be polynomial for inputs that …
Feb. 27, 2019, 2:15 p.m.
Bartosz Klin (joint work with Clovis Eberhart) (Uniwersytet Warszawski)
with atoms (History-dependent mu-calculus)
Motto: Those who cannot remember the past are free to reinvent it. Abstract: Mu-calculus with atoms extends the classical mu-calculus with orbit-finitary boolean operators, to describe properties of transition systems with atoms. Its expressivity …
Feb. 20, 2019, 2:15 p.m.
Rafał Stefański (joint work with Mikołaj Bojańczyk) (Uniwersytet Warszawski)
Single use register automata for data words
We introduce a new automaton model for data words, called single use register automata. These are like register automata for data words (introduced by Kaminski and Francez), with the restriction that every read access to …