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

21 maja 2025 14:15
Antonio Casares (University of Warsaw)
A canonical model of automata over infinite words (A canonical model of automata over infinite words)
Contrary to the case of automata over finite words, deterministic parity automaton cannot be minimised in polynomial time, and omega-regular languages do not admit a unique, minimal deterministic automaton. Yet, not all hope is lost! …
14 maja 2025 14:15
Wojciech Przybyszewski (University of Warsaw)
Flip-separability (Flip-separability)
Nešetřil and Ossona de Mendez proved that for every nowhere dense graph class C, integer r, and ε > 0 there is some integer k with the following property: For every n-vertex graph G in …
30 kwietnia 2025 14:15
Łukasz Kamiński (University of Warsaw)
Reachability in symmetric VASS (Reachability in symmetric VASS)
We investigate the reachability problem in symmetric VASS, where transitions are invariant under a group of permutations of coordinates. One extremal case, the trivial groups, yields general VASS. In another extremal case, the symmetric groups, …
23 kwietnia 2025 14:15
Mathieu Lehaut (University of Warsaw)
Asynchronous automata, trees, and reconfigurability (Asynchronous automata, trees, and reconfigurability)
I will present some results about Zielonka's asynchronous automata, which are a popular automata model for concurrent programs. Zielonka's seminal result about distributivity shows that one can go from a centralized specification given by a …
16 kwietnia 2025 14:15
Henry Sinclair-Banks (University of Warsaw)
Reaching Semilinear Target Sets in Automata with One Counter (Reaching Semilinear Target Sets in Automata with One Counter)
I will introduce a (novel) generalised reachability problem in automata with one counter with a variety of semantics. The goal of the seminar is to identify what features of target sets make the reachability problem …
9 kwietnia 2025 14:15
Aliaume Lopez (University of Warsaw)
Well-quasi-ordered classes of graphs and bounded linear clique-width (Well-quasi-ordered classes of graphs and bounded linear clique-width)
A quasi-ordered set (X, ≤) is a well-quasi-order (WQO) whenever it contains neither infinite antichains, nor infinite decreasing sequences. A cornerstone result of structural graph theory is the Graph Minor Theorem of Robertson and Seymour, …
2 kwietnia 2025 14:15
Jakub Gajarský (University of Warsaw)
3D-grids are not transducible from planar graphs (3D-grids are not transducible from planar graphs)
26 marca 2025 14:15
Francesco Dolce (Czech Technical University in Prague)
A gentle introduction to bifix codes and dendric languages (A gentle introduction to bifix codes and dendric languages)
19 marca 2025 14:15
Michał Skrzypczak (University of Warsaw)
Generalised Quantifiers Based on Rabin-Mostowski Index (Generalised Quantifiers Based on Rabin-Mostowski Index)
I will present our novel results obtained with Denis Kuperberg, Damian Niwiński, and Paweł Parys. The framework is Monadic Second-Order (MSO) logic over \omega-words and infinite trees. We begin with the index problem, which asks, …
12 marca 2025 14:15
Wojciech Przybyszewski (University of Warsaw)
Flipping and forking (Flipping and forking)
5 marca 2025 14:15
Vincent Michielini (University of Warsaw)
Query Entailment Problem for S (Query Entailment Problem for S)
In description logic, possibly infinite structures are described via an ABox A (i.e. a basic finite structure, to be completed), and an ontology T (or a TBox, a finite set of constraints aiming to complete …
26 lutego 2025 14:15
Karolina Drabik (University of Warsaw)
Fined-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs (Fined-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs)
Two fundamental classes of finite automata are deterministic and nondeterministic ones (DFAs and NFAs). Natural intermediate classes arise from bounds on an NFA's allowed ambiguity, i.e. number of accepting runs per word: unambiguous, finitely ambiguous, …
19 lutego 2025 14:15
Rafał Stefański (University of Warsaw)
Polyregular model checking (Polyregular model checking)
We reduce the model checking problem for a subset of Python to the satisfiability of a first-order formula over finite words, which is known to be decidable. The reduction is based on the theory of …
5 lutego 2025 14:15
Wojciech Czerwiński (University of Warsaw)
Reachability in 3-VASS is Elementary (Reachability in 3-VASS is Elementary)
I will present our recent result (with Ismael Jecker, Sławomir Lasota and Łukasz Orlikowski) about the reachability problem in 3-dimensional Vector Addition Systems with States (VASS). We have shown that the problem is in 2-ExpSpace, …
29 stycznia 2025 14:15
Andrew Ryzhikov (University of Warsaw)
A guide to tax-free travelling between codes, automata and matrices (A guide to tax-free travelling between codes, automata and matrices)
In this tutorial talk, I will describe a tight and fruitful relationship between variable-length codes (bases of free submonoids of a free monoid), unambiguous finite automata and semigroups of zero-one matrices. I will concentrate on …