Mahsa Shirmohammadi

James Worrell

CoRR, 2024

Simple Linear Loops: Algebraic Invariants and Applications.

[BibT_eX]

[DOI]

CoRR, 2024

On Tree Automata, Generating Functions, and Differential Equations.

[BibT_eX]

[DOI]

CoRR, 2024

Determination Problems for Orbit Closures and Matrix Groups.

[BibT_eX]

[DOI]

CoRR, 2024

Strategy Complexity of B\"uchi Objectives in Concurrent Stochastic Games.

[BibT_eX]

[DOI]

CoRR, 2024

Memoryless Strategies in Stochastic Reachability Games.

[BibT_eX]

[DOI]

Proceedings of the Taming the Infinities of Concurrency, 2024

2023

Multiplicity Problems on Algebraic Series and Context-Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

The Membership Problem for Hypergeometric Sequences with Quadratic Parameters.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022

A Beginner's Tutorial on Strategy Complexity in Stochastic Games: Can the King Cautiously Eliminate Robin Hood?

[BibT_eX]

[DOI]

ACM SIGLOG News, October, 2022

Costs and rewards in priced timed automata.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Strategy Complexity of Reachability in Countable Stochastic 2-Player Games.

[BibT_eX]

[DOI]

CoRR, 2022

Identity Testing for Radical Expressions.

[BibT_eX]

[DOI]

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

The Membership Problem for Hypergeometric Sequences with Rational Parameters.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021

On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices.

[BibT_eX]

[DOI]

CoRR, 2021

Cyclotomic Identity Testing and Applications.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

Transience in Countable MDPs.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

Trace Refinement in Labelled Markov Decision Processes.

[BibT_eX]

[DOI]

Nathanaël Fijalkow

Stefan Kiefer

Log. Methods Comput. Sci., 2020

Effective definability of the reachability relation in timed automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

How to Play in Infinite MDPs (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Strategy Complexity of Parity Objectives in Countable MDPs.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Concurrency Theory, 2020

Coverability in 1-VASS with Disequality Tests.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Synchronizing Data Words for Register Automata.

[BibT_eX]

[DOI]

Karin Quaas

ACM Trans. Comput. Log., 2019

The complexity of synchronizing Markov decision processes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Synchronizing Automata over Nested Words.

[BibT_eX]

[DOI]

Dmitry Chistikov

Pavel Martyugin

J. Autom. Lang. Comb., 2019

Controlling a Random Population is EXPTIME-hard.

[BibT_eX]

[DOI]

Corto Mascle

Patrick Totzke

CoRR, 2019

Büchi Objectives in Countable MDPs.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

On the Complexity of Value Iteration.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

On the Complexity of Iterative Tropical Computation with Applications to Markov Decision Processes.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Nonnegative Matrix Factorization Requires Irrationality.

[BibT_eX]

[DOI]

SIAM J. Appl. Algebra Geom., 2017

On Rationality of Nonnegative Matrix Factorization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Revisiting reachability in timed automata.

[BibT_eX]

[DOI]

Karin Quaas

James Worrell

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

On strong determinacy of countable stochastic games.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Parity objectives in countable MDPs.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Synchronizing Data Words for Register Automata.

[BibT_eX]

[DOI]

Parvaneh Babari

Karin Quaas

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

On Restricted Nonnegative Matrix Factorization.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2014

Qualitative analysis of synchronizing probabilistic systems. (Analyse qualitative des systèmes probabilistes synchronisants).

[BibT_eX]

[DOI]

PhD thesis, 2014

Synchronizing Words for Weighted and Timed Automata.

[BibT_eX]

[DOI]

Line Juhl

Kim Guldstrand Larsen

Nicolas Markey

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Limit Synchronization in Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2014

Robust Synchronization in Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2012

Infinite Synchronizing Words for Probabilistic Automata (Erratum)

[BibT_eX]

[DOI]

CoRR, 2012

2011

Synchronizing Objectives for Markov Decision Processes

[BibT_eX]

[DOI]

Proceedings of the Proceedings International Workshop on Interactions, Games and Protocols, 2011

Infinite Synchronizing Words for Probabilistic Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010

Roughness in Cayley graphs.

[BibT_eX]

[DOI]

M. H. Shahzamanian