My main research interests are
automata theory (reachability in finite and weighted automata);
matrix theory and algebra in computer science;
formal verification;
semigroup theory and the theory of codes;
(di)graph theory and optimisation.
Publications: (see my dblp for a nicer looking list; the topics are approximate, there are a lot of intersections)
Automata, matrix and digraph reachability:
(with S. Kiefer) The complexity of reachability problems in strongly connected finite automata (submitted) [arxiv]
(with S. Kiefer) Efficiently computing the minimum rank of a matrix in a monoid of zero-one matrices (STACS 2025, LIPIcs vol. 327, pages 66:1–66:22) [conf]
(with S. Kiefer) The complexity of computing the period and the exponent of a digraph (to appear in Information Processing Letters) [journal][arxiv]
On shortest products for nonnegative matrix mortality (RP 2024, LNCS vol. 15050, pages 104–119) [conf] [arxiv] [video] (best paper award!)
(with P. Wolf) Monoids of upper triangular matrices over the Boolean semiring (MFCS 2024, LIPIcs vol. 306, pages 81:1–81:18) [conf]
Synchronizing automata and coding theory (PhD thesis defended at LIGM, Université Paris-Est) [hal]
(with M. V. Berlinkov, R. Ferens, M. Szykula) Synchronizing Strongly Connected Partial DFAs (STACS 2021, LIPICS vol. 187, pages 12:1–12:16) [conf] [arxiv]
Mortality and Synchronization of Unambiguous Finite Automata (WORDS 2019, LNCS vol. 11682, pages 299–311) [conf]
(with J. Kari and A. Varonka) Words of Minimum Rank in Deterministic Finite Automata (DLT 2019, LNCS vol. 11647, pages 74–87) [conf]
(with M. Szykuła) Finding Short Synchronizing Words for Prefix Codes (MFCS 2018, LIPICS vol. 117, pages 21:1–21:14) [conf] [arxiv]
On Automata Recognizing Birecurrent Sets (Theoretical Computer Science 753, pages 76–79, 2019) [journal] [arxiv]
Synchronization Problems in Automata without Non-trivial Cycles (Theoretical Computer Science 787, pages 77–88, 2019, preliminary in CIAA 2017, LNCS vol. 10329, pages 188–200) [journal] [conf] [arxiv]
(with A. Shemyakov) Subset Synchronization in Monotonic Automata (Fundamenta Informaticae 162(2-3), pages 205-221, 2018, preliminary in RuFiDiM 2017, TUCS Lecture Notes vol. 26, 2017, pages 154–164) [journal] [conf] [arxiv]
Semigroups and codes:
Logic, verification, infinite-state systems:
(with P. Wolf) Traversing automata with current state uncertainty under LTLf constraints (to appear in Journal of Automata, Languages and Combinatorics) [arxiv]
(with A. Draghici, R. Piórkowski) Boundedness of cost register automata over the integer min-plus semiring (CSL 2025, LIPIcs vol. 326, pages 20:1–20:23) [conf] [slides]
(with A. Draghici, C. Haase) Reachability in Fixed VASS: Expressiveness and Lower Bounds (FoSSaCS 2024, LNCS vol. 14575, pages 185–205) [conf] [arxiv] [slides]
(with L. Daviaud) Universality and Forall-Exactness of Cost Register Automata with Few Registers (MFCS 2023, LIPIcs vol. 272, pages 40:1–40:15) [conf]
(with N. El-Naggar, L. Daviaud, P. Madhyastha, T. Weyde) Formal and Empirical Studies of Counting Behaviour in ReLU RNNs (ICGI 2023, PMLR vol. 217, pages 199-222) [conf]
Combinatorial optimization and graph theory:
(with I. Fridman, M. Y. Kovalyov, E. Pesch) Fixed interval scheduling with third-party machines (Networks 77(3): 361-371 (2021), very preliminary in Discrete Mathematics, Algebra and Their Applications (DIMA 2015)) [journal] [conf]
(with M. Y. Kovalyov and E. Pesch) A Note on Scheduling Container Storage Operations of Two Non-passing Stacking Cranes (Networks 71(3), pages 271–280, 2018, preliminary in Tanaev Readings 2016 Proceedings of the 7th International Conference “Tanaev’s Readings”, pages 222-226 (not available online)) [journal] [conf]
(with Y. Kartynnik) On Minimum Maximal Distance-k Matchings (Discrete Mathematics & Theoretical Computer Science 20(1), 2018, preliminary in 1st IMA Conference on Theoretical and Computational Discrete Mathematics (TCDM 2016), ENDM volume 56, pages 71–76) [journal] [conf] [arxiv]
Combinatorics on words: