Edon Kelmendi

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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
scientific article; zbMATH DE number 7788988 (Why is no real title available?) (available as arXiv preprint)	2024-01-16	Paper
Submixing and shift-invariant stochastic games International Journal of Game Theory	2024-01-04	Paper
What's decidable about discrete linear dynamical systems? Lecture Notes in Computer Science	2023-08-10	Paper
Value iteration for simple stochastic games: stopping criterion and learning algorithm Computer Aided Verification	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 Information and Computation	2022-06-08	Paper
Extensions of \(\omega \)-regular languages Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science	2021-01-21	Paper
Emptiness of zero automata is decidable (available as arXiv preprint)	2020-05-27	Paper
Stamina: stabilisation monoids in automata theory	2017-08-22	Paper
Deciding maxmin reachability in half-blind stochastic games Algorithmic Game Theory	2016-09-29	Paper
Deciding the value 1 problem for probabilistic leaktight automata Logical Methods in Computer Science	2015-08-25	Paper

Research outcomes over time

This page was built for person: Edon Kelmendi