The surprizing complexity of reachability games - Nathanaël Fijalkow; Florian Horn 001 (CoRR, 2010)

Finitary Languages. - Krishnendu Chatterjee; Nathanaël Fijalkow (LATA, 2011)

Pushing undecidability of the isolation problem for probabilistic automata - Nathanaël Fijalkow; Hugo Gimbert; Youssouf Oualhadj (CoRR, 2011)

A Class of Probabilistic Automata with a Decidable Value 1 Problem - Nathanaël Fijalkow; Hugo Gimbert; Youssouf Oualhadj (CoRR, 2011)

A reduction from parity games to simple stochastic games - Krishnendu Chatterjee; Nathanaël Fijalkow (GandALF, 2011)

Cost-Parity and Cost-Streett Games. - Nathanaël Fijalkow; Martin Zimmermann 002 (FSTTCS, 2012)

Deciding the Value 1 Problem for Probabilistic Leaktight Automata. - Nathanaël Fijalkow; Hugo Gimbert; Youssouf Oualhadj (LICS, 2012)

Infinite-state games with finitary conditions. - Krishnendu Chatterjee; Nathanaël Fijalkow (CSL, 2013)

Emptiness Of Alternating Tree Automata Using Games With Imperfect Information. - Nathanaël Fijalkow; Sophie Pinchinat; Olivier Serre (FSTTCS, 2013)

Les jeux d'accessibilité généralisée. - Nathanaël Fijalkow; Florian Horn 001 (Tech. Sci. Informatiques, 2013)

ACME: Automata with Counters, Monoids and Equivalence. - Nathanaël Fijalkow; Denis Kuperberg (ATVA, 2014)

Playing Safe. - Thomas Colcombet; Nathanaël Fijalkow; Florian Horn 001 (FSTTCS, 2014)

Two Recursively Inseparable Problems for Probabilistic Automata. - Nathanaël Fijalkow; Hugo Gimbert; Florian Horn 001; Youssouf Oualhadj (MFCS (1), 2014)

What is known about the Value 1 Problem for Probabilistic Automata? - Nathanaël Fijalkow (CoRR, 2014)

Parity and Streett Games with Costs - Nathanaël Fijalkow; Martin Zimmermann 002 (Log. Methods Comput. Sci., 2014)

Trading Bounds for Memory in Games with Counters. - Nathanaël Fijalkow; Florian Horn 001; Denis Kuperberg; Michal Skrzypczak (ICALP (2), 2015)

Irregular Behaviours for Probabilistic Automata. - Nathanaël Fijalkow; Michal Skrzypczak (RP, 2015)

Profinite Techniques for Probabilistic Automata and the Optimality of the Markov Monoid Algorithm. - Nathanaël Fijalkow (CoRR, 2015)

Deciding the value 1 problem for probabilistic leaktight automata. - Nathanaël Fijalkow; Hugo Gimbert; Edon Kelmendi; Youssouf Oualhadj (Log. Methods Comput. Sci., 2015)

Counting and Randomising in Automata Theory. (Compteurs et Aléas en Théorie des Automates). - Nathanaël Fijalkow (2015)

The Bridge Between Regular Cost Functions and Omega-Regular Languages. - Thomas Colcombet; Nathanaël Fijalkow (ICALP, 2016)

The Online Space Complexity of Probabilistic Languages. - Nathanaël Fijalkow (LFCS, 2016)

Characterisation of an Algebraic Algorithm for Probabilistic Automata. - Nathanaël Fijalkow (STACS, 2016)

Lower Bounds for Alternating Online Space Complexity. - Nathanaël Fijalkow (Electron. Colloquium Comput. Complex., 2016)

Expressiveness of Probabilistic Modal Logics, Revisited. - Nathanaël Fijalkow; Bartek Klin; Prakash Panangaden (ICALP, 2017)

Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. - Nathanaël Fijalkow; Pierre Ohlmann; Joël Ouaknine; Amaury Pouly; James Worrell 001 (STACS, 2017)

Stamina: Stabilisation Monoids in Automata Theory. - Nathanaël Fijalkow; Hugo Gimbert; Edon Kelmendi; Denis Kuperberg (CIAA, 2017)

Profinite Techniques for Probabilistic Automata. - Nathanaël Fijalkow (Bull. EATCS, 2017)

Undecidability results for probabilistic automata. - Nathanaël Fijalkow (ACM SIGLOG News, 2017)

Profinite techniques for probabilistic automata and the Markov Monoid algorithm. - Nathanaël Fijalkow (Theor. Comput. Sci., 2017)

Monadic Second-Order Logic with Arbitrary Monadic Predicates. - Nathanaël Fijalkow; Charles Paperman (ACM Trans. Comput. Log., 2017)

Quantifying Bounds in Strategy Logic. - Nathanaël Fijalkow; Bastien Maubert; Aniello Murano; Sasha Rubin (CSL, 2018)

Timed Comparisons of Semi-Markov Processes. - Mathias Ruggaard Pedersen; Nathanaël Fijalkow; Giorgio Bacci; Kim G. Larsen; Radu Mardare (LATA, 2018)

The State Complexity of Alternating Automata. - Nathanaël Fijalkow (LICS, 2018)

An Optimal Value Iteration Algorithm for Parity Games. - Nathanaël Fijalkow (CoRR, 2018)

Parity games and universal graphs. - Thomas Colcombet; Nathanaël Fijalkow (CoRR, 2018)

The complexity of mean payoff games using universal graphs. - Nathanaël Fijalkow; Pawel Gawrychowski; Pierre Ohlmann (CoRR, 2018)

Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees. - Nathanaël Fijalkow; Guillaume Lagarde; Pierre Ohlmann (Electron. Colloquium Comput. Complex., 2018)

Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games. - Thomas Colcombet; Nathanaël Fijalkow (FoSSaCS, 2019)

On the decidability of reachability in linear time-invariant systems. - Nathanaël Fijalkow; Joël Ouaknine; Amaury Pouly; João Sousa Pinto; James Worrell 001 (HSCC, 2019)

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. - Wojciech Czerwinski; Laure Daviaud; Nathanaël Fijalkow; Marcin Jurdzinski; Ranko Lazic 001; Pawel Parys (SODA, 2019)

Verification of Neural Networks: Specifying Global Robustness using Generative Models. - Nathanaël Fijalkow; Mohit Kumar Gupta (CoRR, 2019)

Expressiveness of probabilistic modal logics: A gradual approach. - Florence Clerc; Nathanaël Fijalkow; Bartek Klin; Prakash Panangaden (Inf. Comput., 2019)

Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. - Nathanaël Fijalkow; Pierre Ohlmann; Joël Ouaknine; Amaury Pouly; James Worrell 001 (Theory Comput. Syst., 2019)

Data Generation for Neural Programming by Example. - Judith Clymo; Adrià Gascón; Brooks Paige; Nathanaël Fijalkow; Haik Manukian (AISTATS, 2020)

The Theory of Universal Graphs for Games: Past and Future. - Nathanaël Fijalkow (CMCS, 2020)

Assume-Guarantee Synthesis for Prompt Linear Temporal Logic. - Nathanaël Fijalkow; Bastien Maubert; Aniello Murano; Moshe Y. Vardi (IJCAI, 2020)

Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. - Nathanaël Fijalkow; Pawel Gawrychowski; Pierre Ohlmann (MFCS, 2020)

Optimal transformations of Muller conditions. - Antonio Casares; Thomas Colcombet; Nathanaël Fijalkow (CoRR, 2020)

Trace Refinement in Labelled Markov Decision Processes. - Nathanaël Fijalkow; Stefan Kiefer; Mahsa Shirmohammadi (Log. Methods Comput. Sci., 2020)

Lower bounds for the state complexity of probabilistic languages and the language of prime numbers. - Nathanaël Fijalkow (J. Log. Comput., 2020)

Consistent Unsupervised Estimators for Anchored PCFGs. - Alexander Clark; Nathanaël Fijalkow (Trans. Assoc. Comput. Linguistics, 2020)

Statistical Comparison of Algorithm Performance Through Instance Selection. - Théo Matricon; Marie Anastacio; Nathanaël Fijalkow; Laurent Simon 001; Holger H. Hoos (CP, 2021)

Optimal Transformations of Games and Automata Using Muller Conditions. - Antonio Casares; Thomas Colcombet; Nathanaël Fijalkow (ICALP, 2021)

The complexity of learning linear temporal formulas from examples. - Nathanaël Fijalkow; Guillaume Lagarde (ICGI, 2021)

Lower Bounds for Arithmetic Circuits via the Hankel Matrix. - Nathanaël Fijalkow; Guillaume Lagarde; Pierre Ohlmann; Olivier Serre (Comput. Complex., 2021)

New Algorithms for Combinations of Objectives using Separating Automata. - Ashwani Anand; Nathanaël Fijalkow; Aliénor Goubault-Larrecq; Jérôme Leroux; Pierre Ohlmann (GandALF, 2021)

Scalable Anytime Algorithms for Learning Formulas in Linear Temporal Logic. - Ritam Raha; Rajarshi Roy 002; Nathanaël Fijalkow; Daniel Neider (CoRR, 2021)

Controlling a random population. - Thomas Colcombet; Nathanaël Fijalkow; Pierre Ohlmann (Log. Methods Comput. Sci., 2021)

Alternating Tree Automata with Qualitative Semantics. - Raphaël Berthon; Nathanaël Fijalkow; Emmanuel Filiot; Shibashis Guha; Bastien Maubert; Aniello Murano; Laureline Pinault; Sophie Pinchinat; Sasha Rubin; Olivier Serre (ACM Trans. Comput. Log., 2021)

The Game of Synthesis. - Nathanaël Fijalkow (2022)

Scaling Neural Program Synthesis with Distribution-Based Search. - Nathanaël Fijalkow; Guillaume Lagarde; Théo Matricon; Kevin Ellis; Pierre Ohlmann; Akarsh Nayan Potta (AAAI, 2022)

Public and Private Affairs in Strategic Reasoning. - Nathanaël Fijalkow; Bastien Maubert; Aniello Murano; Sasha Rubin; Moshe Y. Vardi (KR, 2022)

Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic. - Ritam Raha; Rajarshi Roy 002; Nathanaël Fijalkow; Daniel Neider (TACAS (1), 2022)

A robust class of linear recurrence sequences. - Corentin Barloy; Nathanaël Fijalkow; Nathan Lhote; Filip Mazowiecki (Inf. Comput., 2022)

Probabilistic automata of bounded ambiguity. - Nathanaël Fijalkow; Cristian Riveros; James Worrell 001 (Inf. Comput., 2022)

The Theory of Universal Graphs for Infinite Duration Games. - Thomas Colcombet; Nathanaël Fijalkow; Pawel Gawrychowski; Pierre Ohlmann (Log. Methods Comput. Sci., 2022)

DeepSynth: Scaling Neural Program Synthesis with Distribution-based Search. - Théo Matricon; Nathanaël Fijalkow; Guillaume Lagarde; Kevin Ellis (J. Open Source Softw., 2022)

How to Play Optimally for Regular Objectives? - Patricia Bouyer; Nathanaël Fijalkow; Mickael Randour; Pierre Vandenhove (ICALP, 2023)

WikiCoder: Learning to Write Knowledge-Powered Code. - Théo Matricon; Nathanaël Fijalkow; Gaëtan Margueritte (SPIN, 2023)

Games on Graphs. - Nathanaël Fijalkow; Nathalie Bertrand 001; Patricia Bouyer-Decitre; Romain Brenguier; Arnaud Carayol; John Fearnley; Hugo Gimbert; Florian Horn 001; Rasmus Ibsen-Jensen; Nicolas Markey; Benjamin Monmege; Petr Novotný 001; et al. (CoRR, 2023)

Learning temporal formulas from examples is hard. - Corto Mascle; Nathanaël Fijalkow; Guillaume Lagarde (CoRR, 2023)

The Futures of Reactive Synthesis (Dagstuhl Seminar 23391). - Nathanaël Fijalkow; Bernd Finkbeiner; Guillermo A. Pérez 001; Elizabeth Polgreen; Rémi Morvan (Dagstuhl Reports, 2023)

LTL Learning on GPUs. - Mojtaba Valizadeh; Nathanaël Fijalkow; Martin Berger 001 (CAV (3), 2024)

Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic. - Ritam Raha; Rajarshi Roy 002; Nathanaël Fijalkow; Daniel Neider; Guillermo A. Pérez 001 (VMCAI (2), 2024)

Theoretical foundations for programmatic reinforcement learning. - Guruprerana Shabadi; Nathanaël Fijalkow; Théo Matricon (CoRR, 2024)

EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis. - Théo Matricon; Nathanaël Fijalkow; Guillaume Lagarde (CoRR, 2024)

Stochastic Games (Dagstuhl Seminar 24231). - Nathanaël Fijalkow; Jan Kretínský; Ann Nowé; Gabriel Bathie (Dagstuhl Reports, 2024)

Playing Safe, Ten Years Later. - Thomas Colcombet; Nathanaël Fijalkow; Florian Horn 001 (Log. Methods Comput. Sci., 2024)

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism. - Antonio Casares; Thomas Colcombet; Nathanaël Fijalkow; Karoliina Lehtinen (TheoretiCS, 2024)

Scarlet: Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic. - Ritam Raha; Rajarshi Roy 002; Nathanaël Fijalkow; Daniel Neider (J. Open Source Softw., 2024)

Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives. - Marius Belly; Nathanaël Fijalkow; Hugo Gimbert; Florian Horn 001; Guillermo A. Pérez 001; Pierre Vandenhove (AAAI, 2025)

Eco Search: A No-delay Best-First Search Algorithm for Program Synthesis. - Théo Matricon; Nathanaël Fijalkow; Guillaume Lagarde (AAAI, 2025)

The Trichotomy of Regular Property Testing. - Gabriel Bathie; Nathanaël Fijalkow; Corto Mascle (ICALP, 2025)

GPU accelerated program synthesis: Enumerate semantics, not syntax! - Martin Berger 001; Nathanaël Fijalkow; Mojtaba Valizadeh (CoRR, 2025)

On the Monniaux Problem in Abstract Interpretation. - Nathanaël Fijalkow; Engel Lefaucheux; Pierre Ohlmann; Joël Ouaknine; Amaury Pouly; James Worrell 001 (J. ACM, 2025)

An Explainable Diagnostic Framework for Neurodegenerative Dementias via Reinforcement-Optimized LLM Reasoning. - Andrew Zamai; Nathanaël Fijalkow; Boris Mansencal; Laurent Simon 001; Eloi Navet; Pierrick Coupé (CoRR, 2025)