Nie jesteś zalogowany | Zaloguj się
Powrót do listy aktywnych seminarów

Seminarium „Teoria automatów”

Cotygodniowe seminarium badawcze


Organizatorzy

Informacje

środy, 14:15 , sala: 5440

Dziedziny badań

Lista referatów

  • 29 marca 2023 14:15
    Giannos Stamoulis (LIRMM, Université de Montpellier, CNRS)
    Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes
    Disjoint-paths logic, denoted FO+DP, extends first-order logic (FO) with atomic predicates dp_k[(x_1, y_1),…,(x_k, y_k)], expressing the existence of internally vertex-disjoint paths between x_i and y_i, for 1 ≤ i ≤ k. In this talk, we …

  • 22 marca 2023 14:15
    Wojciech Przybyszewski (MIM UW)
    Reproving combinatorial properties of nowhere-dense graphs using model theory
    A pinnacle of sparsity theory, initiated by Ossona de Mendez and Nešetřil, is the result of Grohe, Kreutzer, and Siebertz which identifies subgraf-closed classes of graphs with FPT model checking as exactly nowhere dense classes. …

  • 15 marca 2023 14:15
    Arka Ghosh (MIM UW)
    Orbit-finite systems of inequalities
    A system of inequalities is orbit-finite if it is finite up to certain permutations of variables. In this talk, I will describe this concept using interesting examples, and present our recent results on the solvability …

  • 8 marca 2023 14:15
    Michał Skrzypczak (MIM UW)
    Binary counting is hard (for context-free grammars)
    Michaël Cadilhac recently (on Autoboz) asked the following problem: Take n > 0 and consider the alphabet A_n = { 2^i | i ≤ n }. Let L_n be the set of words over A_n …

  • 1 marca 2023 14:15
    Florent Koechlin (LORIA)
    Two criteria to prove the inherent ambiguity of bounded context-free languages
    A context-free language is inherently ambiguous if any grammar recognizing it is ambiguous, i.e. there is a word that is generated in two different ways. Deciding the inherent ambiguity of a context-free language is a …

  • 25 stycznia 2023 14:15
    Hugo Gimbert (CNRS, LaBRI, Université de Bordeaux)
    Martin’s proof of Borel determinacy
    Donald Martin established Borel determinacy in 1975: in every Gale-Stewart game with a Borel winning condition, either player I or player II has a winning strategy. We present Martin’s proof under a different perspective (bottom-up …

  • 18 stycznia 2023 14:15
    Mikołaj Bojańczyk (MIM UW)
    TBA

  • 11 stycznia 2023 14:15
    Pierre Ohlmann (MIM UW)
    Memory in games and universal graphs
    I will present recent characterisations of positionality and finite memory in infinite duration games by means of universal graphs. The goal is to derive properties of games with a given objective W by understanding the …

  • 21 grudnia 2022 14:15
    Marcin Przybyłko (University of Leipzig)
    Enumerating Answers to Ontology Mediated Queries
    A known dichotomy states that for conjunctive queries (CQs) with no self-joins the set of answers can be enumerated with linear preprocessing* and constant delay* if and only** if the query is both acyclic and …

  • 14 grudnia 2022 14:15
    Antonio Casares Santos (LaBRI, Université de Bordeaux)
    A correspondence between memory and automata for Muller languages
    In this talk, we will be interested in infinite-duration games using Muller winning conditions, that is, the objective of such games is given by a boolean combination of colors that have to appear infinitely often. …

  • 7 grudnia 2022 14:15
    Lorenzo Clemente (MIM UW)
    Decidability of equivalence of deterministic one-way multitape finite automata
    I will present an old decidability result by Harju and Karhumäki, as in the title. The original proof involves some very nice algebraic constructions, which constitute the motivation for this presentation. We start from the …

  • 30 listopada 2022 14:15
    David Purser (MIM UW)
    The big-O problem for max-plus automata
    Given two weighted automata A and B over the (N, max, plus) semi-ring we consider the problem of deciding whether there exists a constant c such that A(w) ≤ c B(w) + c for every …

  • 23 listopada 2022 14:15
    Jakob Piribauer (TU Dresden)
    Tradeoff between expectation and variance in Markov decision processes
    The stochastic shortest path problem asks to resolve the non-deterministic choices in a Markov decision process (MDP) such that the expected accumulated weight before reaching a target state is maximized. This problem is well-studied and …

  • 16 listopada 2022 14:15
    Mikołaj Bojańczyk (MIM UW)
    Folding interpretations
    In this talk, I will discuss a characterisation of the polyregular functions which uses folding. The idea is to use the combinator approach, i.e. start with certain atomic functions (such as list concatenation) and apply …

  • 9 listopada 2022 14:15
    Paweł Parys (MIM UW)
    Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete
    We consider the problem of deciding whether a given pushdown system all of whose ε-transitions are deterministic is weakly bisimulation finite, that is, whether it is weakly bisimulation equivalent to a finite system. We prove …