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

18 grudnia 2024 14:15
Lorenzo Clemente (University of Warsaw)
The commutativity problem for varieties of formal series and applications (The commutativity problem for varieties of formal series and applications)
Let Σ be a finite alphabet of noncommuting indeterminates. A *formal series* over the rational numbers is a mapping Σ* → ℚ. We say that it is *commutative* if the output does not depend on …
11 grudnia 2024 14:15
Martin Grohe (RWTH Aachen University)
Some Thoughts on Graph Similarity (Some Thoughts on Graph Similarity)
We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.
4 grudnia 2024 14:15
Paweł Parys (University of Warsaw)
A Dichotomy Theorem for Ordinal Ranks in MSO (A Dichotomy Theorem for Ordinal Ranks in MSO)
We focus on formulae ∃X.ϕ(Y, X) of monadic second-order logic over the full binary tree, such that the witness X is a well-founded set. The ordinal rank rank(X) < ω_1 of such a set X …
27 listopada 2024 14:15
Michał Skrzypczak (University of Warsaw)
Index problem for tree automata - revisited (Index problem for tree automata - revisited)
This talk is mostly "other people's work" type of a talk. However, it is meant to prepare ground for the next week, when Paweł Parys will present our joint results with Damian Niwiński. I want …
20 listopada 2024 14:15
Mikołaj Bojańczyk (University of Warsaw)
Transducers and straight line programs (Transducers and straight line programs)
In this talk, a straight line program (SLP) is a context-free grammar that generates a single string. This can be viewed as a compression scheme, with the compressed string being possibly exponentially smaller than the …
13 listopada 2024 14:15
Szymon Toruńczyk (University of Warsaw)
Merge-width and First-Order Model Checking (Merge-width and First-Order Model Checking)
We introduce merge-width, a family of graph parameters that unifies several structural graph measures, including treewidth, degeneracy, twin-width, clique-width, and generalized coloring numbers. Graph classes of bounded merge-width – for which the radius-r merge-width parameter …
6 listopada 2024 14:15
Mathieu Lehaut (University of Gothenburg)
Synthesis for first order specifications over data words (Synthesis for first order specifications over data words)
We study the reactive synthesis problem for distributed systems with a finite but unbounded number of participants interacting with an uncontrollable environment. Executions of those systems are modelled by data words, and specifications are given …
30 października 2024 14:15
Piotr Hofman (University of Warsaw)
Soundness for Workflows with Reset Arcs (Soundness for Workflows with Reset Arcs)
Workflows are a subclass of Petri nets designed to model business processes. Various definitions of soundness for workflows have been proposed, with the two most prominent being "soundness" and the stronger "generalized soundness." We begin …
23 października 2024 14:15
Antoni Puch (University of Warsaw)
Minimising ambiguity of weighted automata (Minimising ambiguity of weighted automata)
By bounding the number of accepting runs of automata we obtain various subclasses of them. We consider: unambiguous automata, finitely-ambiguous automata, and polynomially-ambiguous automata, where the number of runs is bounded by 1, a constant, …
16 października 2024 14:15
Antonio Casares (University of Warsaw)
An algorithm to rule them all: Fast value iteration for energy games (An algorithm to rule them all: Fast value iteration for energy games)
We introduce a uniform framework for describing, comparing, and proving correctness of algorithms for energy games (which generalise the well known parity games). This framework allows us to provide simple presentations and correctness proofs of …
9 października 2024 14:15
Lorenzo Clemente (University of Warsaw)
Control theory and series in noncommuting variables (Control theory and series in noncommuting variables)
We present Michel Fliess' work from the 1970's showing surprising connections between control theory and the theory of series in noncommuting variables. More precisely, to a dynamical system with inputs S one can associate a …
2 października 2024 14:15
Ioannis Eleftheriadis (University of Cambridge)
Preservation theorems on tame classes of finite structures (Preservation theorems on tame classes of finite structures)
Preservation theorems provide a correspondence between the syntactic structure and the semantic behaviour of first-order sentences. The study of preservation theorems relativised to classes of finite structures was initiated by Atserias, Dawar, and Kolaitis [JACM, …
4 września 2024 14:15
Sven Manthe (University of Bonn)
The Borel monadic theory of order is decidable (The Borel monadic theory of order is decidable)
When proving decidability of S2S, Rabin derived decidability of the monadic theory of (ℝ,<) with quantification restricted to Fσ-sets. Undecidability of the unrestricted monadic theory of (ℝ,<) was proven by Shelah. We discuss decidability for …
19 czerwca 2024 14:15
Teodor Knapik (ISEA, Université de la Nouvelle Calédonie)
Lindenmayer graph languages, first-order theories and expanders (Lindenmayer graph languages, first-order theories and expanders)
Imagined by Kolmogorov in the middle of past century, expanders form remarkable graph families with applications in areas as diverse as robust communication networks and probabilistically checkable proofs, to name just two. Since the proof …
12 czerwca 2024 14:15
Łukasz Kamiński (University of Warsaw)
Bi-reachability in Petri nets with data
Petri nets with equality data is an extension of plain Petri nets where tokens carry values from an infinite data domain, and executability of transitions is conditioned by equalities between data values. The most fundamental …