Edon Kelmendi

Available identifiers

zbMath Open kelmendi.edonMaRDI QIDQ2399251

List of research outcomes

Publication	Date of Publication	Type
MSO+\( \nabla \) is undecidable	2024-12-19	Paper
Computing the density of the positivity set for linear recurrence sequences	2024-12-06	Paper
https://portal.mardi4nfdi.de/entity/Q6137833	2024-01-16	Paper
Submixing and shift-invariant stochastic games	2024-01-04	Paper
What's decidable about discrete linear dynamical systems?	2023-08-10	Paper
Value iteration for simple stochastic games: stopping criterion and learning algorithm	2023-05-26	Paper
Reachability in Injective Piecewise Affine Maps	2023-01-23	Paper
Value iteration for simple stochastic games: stopping criterion and learning algorithm	2022-06-08	Paper
Extensions of \(\omega \)-regular languages	2021-01-21	Paper
Emptiness of zero automata is decidable	2020-05-27	Paper
Stamina: stabilisation monoids in automata theory	2017-08-22	Paper
Deciding maxmin reachability in half-blind stochastic games	2016-09-29	Paper
Deciding the value 1 problem for probabilistic leaktight automata	2015-08-25	Paper

Research outcomes over time

This page was built for person: Edon Kelmendi