Nathanaël Fijalkow
Nathanaël Fijalkow
CNRS, LaBRI, Bordeaux, and The Alan Turing Institute of data science
Verified email at - Homepage
Cited by
Cited by
Parity and Streett Games with Costs
N Fijalkow, M Zimmermann
Logical Methods in Computer Science (arXiv preprint arXiv:1207.0663) 10 (2), 2012
Deciding the value 1 problem for probabilistic leaktight automata
N Fijalkow, H Gimbert, Y Oualhadj
Proceedings of LICS'2012 (the 2012 27th Annual IEEE/ACM Symposium on Logic …, 2012
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
W Czerwiński, L Daviaud, N Fijalkow, M Jurdziński, R Lazić, P Parys
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Les jeux d'accessibilité généralisée.
N Fijalkow, F Horn
Technique et Science Informatiques 32 (9-10), 931-949, 2013
Infinite-state games with finitary conditions
K Chatterjee, N Fijalkow
Proceedings of CSL'2013, 2013
Universal graphs and good for games automata: New tools for infinite duration games
T Colcombet, N Fijalkow
International Conference on Foundations of Software Science and Computation …, 2019
Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
N Fijalkow, S Pinchinat, O Serre
Proceedings of FSTTCS'2013, 2013
Probabilistic automata of bounded ambiguity
N Fijalkow, C Riveros, J Worrell
Information and Computation, 104648, 2020
A reduction from parity games to simple stochastic games
K Chatterjee, N Fijalkow
Proceedings of GanDALF'2011, 2011
Undecidability results for probabilistic automata
N Fijalkow
ACM SIGLOG News 4 (4), 10-17, 2017
Expressiveness of probabilistic modal logics, revisited
N Fijalkow, B Klin, P Panangaden
44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017
Trace refinement in labelled Markov decision processes
N Fijalkow, S Kiefer, M Shirmohammadi
International Conference on Foundations of Software Science and Computation …, 2016
Trading bounds for memory in games with counters
N Fijalkow, F Horn, D Kuperberg, M Skrzypczak
International Colloquium on Automata, Languages, and Programming, 197-208, 2015
On the decidability of reachability in linear time-invariant systems
N Fijalkow, J Ouaknine, A Pouly, J Sousa-Pinto, J Worrell
Proceedings of the 22nd ACM International Conference on Hybrid Systems …, 2019
Semialgebraic invariant synthesis for the kannan-lipton orbit problem
N Fijalkow, P Ohlmann, J Ouaknine, A Pouly, J Worrell
arXiv preprint arXiv:1701.02162, 2017
The online space complexity of probabilistic languages
N Fijalkow
International Symposium on Logical Foundations of Computer Science, 106-116, 2016
The bridge between regular cost functions and omega-regular languages
T Colcombet, N Fijalkow
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
Irregular behaviours for probabilistic automata
N Fijalkow, M Skrzypczak
International Workshop on Reachability Problems, 33-36, 2015
The complexity of mean payoff games using universal graphs
N Fijalkow, P Gawrychowski, P Ohlmann
arXiv preprint arXiv:1812.07072, 2018
Quantifying bounds in strategy logic
N Fijalkow, B Maubert, A Murano, S Rubin
CSL 23, 2018
The system can't perform the operation now. Try again later.
Articles 1–20