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
The Theory of Universal Graphs for Infinite Duration Games
T Colcombet, N Fijalkow, P Gawrychowski, P Ohlmann
arXiv preprint arXiv:2104.05262, 2021
Les jeux d'accessibilité généralisée.
N Fijalkow, F Horn
Tech. Sci. Informatiques 32 (9-10), 931-949, 2013
Infinite-state games with finitary conditions
K Chatterjee, N Fijalkow
Proceedings of CSL'2013, 2013
Probabilistic automata of bounded ambiguity
N Fijalkow, C Riveros, J Worrell
Information and Computation, 104648, 2020
Expressiveness of probabilistic modal logics: A gradual approach
F Clerc, N Fijalkow, B Klin, P Panangaden
Information and Computation 267, 145-163, 2019
Undecidability results for probabilistic automata
N Fijalkow
ACM SIGLOG News 4 (4), 10-17, 2017
A reduction from parity games to simple stochastic games
K Chatterjee, N Fijalkow
Proceedings of GanDALF'2011, 2011
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
Alternating Tree Automata with Qualitative Semantics
R Berthon, N Fijalkow, E Filiot, S Guha, B Maubert, A Murano, L Pinault, ...
ACM Transactions on Computational Logic (TOCL) 22 (1), 1-24, 2020
Value iteration using universal graphs and the complexity of mean payoff games
N Fijalkow, P Gawrychowski, P Ohlmann
45th International Symposium on Mathematical Foundations of Computer Science …, 2020
Consistent unsupervised estimators for anchored PCFGs
A Clark, N Fijalkow
Transactions of the Association for Computational Linguistics 8, 409-422, 2020
Trace Refinement in Labelled Markov Decision Processes
M Shirmohammadi, S Kiefer, N Fijalkow
Logical Methods in Computer Science 16, 2020
Data generation for neural programming by example
J Clymo, H Manukian, N Fijalkow, A Gascón, B Paige
International Conference on Artificial Intelligence and Statistics, 3450-3459, 2020
A robust class of linear recurrence sequences
C Barloy, N Fijalkow, N Lhote, F Mazowiecki
arXiv preprint arXiv:1908.03890, 2019
Complete semialgebraic invariant synthesis for the kannan-lipton orbit problem
N Fijalkow, P Ohlmann, J Ouaknine, A Pouly, J Worrell
Theory of Computing Systems 63 (5), 1027-1048, 2019
Playing safe
T Colcombet, N Fijalkow, F Horn
34th International Conference on Foundation of Software Technology and …, 2014
Optimal transformations of Muller conditions
A Casares, T Colcombet, N Fijalkow
arXiv preprint arXiv:2011.13041, 2020
The system can't perform the operation now. Try again later.
Articles 1–20