Markus completed his PhD in Discrete Mathematics in 2019 from the University of Turku. He then had a Postdoc position in the Foundations of Algorithmic Verification group at the Max Planck Institute for Software Systems, Saarbrücken, for two years. He was then awarded a FRS-FNRS Postdoctoral Fellowship to work at the Department of Mathematics, University of Liège. He became a lecturer at the Department of Computer Science at º¬Ðß²ÝÊÓƵ in August 2024.
Markus' research interests lie in symbolic dynamical systems from the viewpoint of combinatorial aspects of words (or strings), both finite and infinite. Specific topics include various complexity functions of infinite words, as well as numeration systems arising from regular languages. Other research interests are decidability questions related to linear dynamical systems with respect to foundations of software verification.
Research areas
- Combinatorics on Words
- Automata theory in connection with numeration systems
- Foundations of software verification
- Programme committee member of WORDS’23, DLT’24, MFCS’25
- Reviewer for several conferences and journals.
- Coaching for IMC for University Students’2024
- S. Puzynina and M.A. Whiteland: Abelian closures of infinite binary words. J. Comb. Theory, Ser. A 185:#105524 (2022), doi: https://dx.doi.org/10.1016/j.jcta.2021.105524
- T. Karimov et al.: What's decidable about linear loops? Proc. ACM Program. Lang., Vol. 6, No. POPL, Article 65 (2022), doi: https://dx.doi.org/10.1145/3498727.