受强制性开放获取政策约束的文章 - Nathanaël Fijalkow了解详情
可在其他位置公开访问的文章：25 篇
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
SODA, Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2333-2349, 2019
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, Agence Nationale de …
Scalable anytime algorithms for learning fragments of linear temporal logic
R Raha, R Roy, N Fijalkow, D Neider
TACAS, International Conference on Tools and Algorithms for the Construction …, 2022
强制性开放获取政策： Research Foundation (Flanders), German Research Foundation
On the decidability of reachability in linear time-invariant systems
N Fijalkow, J Ouaknine, A Pouly, J Sousa-Pinto, J Worrell
HSCC, 22nd ACM International Conference on Hybrid Systems: Computation and …, 2019
强制性开放获取政策： German Research Foundation, UK Engineering and Physical Sciences Research …
Universal graphs and good for games automata: New tools for infinite duration games
T Colcombet, N Fijalkow
FoSSaCS, International Conference on Foundations of Software Science and …, 2019
强制性开放获取政策： European Commission, Agence Nationale de la Recherche
Expressiveness of probabilistic modal logics, revisited
N Fijalkow, B Klin, P Panangaden
ICALP, 44th International Colloquium on Automata, Languages, and Programming, 2017
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada, UK Engineering …
Value iteration using universal graphs and the complexity of mean payoff games
N Fijalkow, P Gawrychowski, P Ohlmann
MFCS, 45th International Symposium on Mathematical Foundations of Computer …, 2020
强制性开放获取政策： Agence Nationale de la Recherche
A Robust Class of Linear Recurrence Sequences
C Barloy, N Fijalkow, N Lhote, F Mazowiecki
CSL, 28th EACSL Annual Conference on Computer Science Logic 152, 2020
强制性开放获取政策： Agence Nationale de la Recherche
Consistent unsupervised estimators for anchored PCFGs
A Clark, N Fijalkow
Transactions of the Association for Computational Linguistics 8, 409-422, 2020
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, Agence Nationale de …
Data generation for neural programming by example
J Clymo, H Manukian, N Fijalkow, A Gascón, B Paige
AI&STAT, International Conference on Artificial Intelligence and Statistics …, 2020
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
Expressiveness of probabilistic modal logics: A gradual approach
F Clerc, N Fijalkow, B Klin, P Panangaden
Information and Computation 267, 145-163, 2019
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada, UK Engineering …
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, 1027-1048, 2019
强制性开放获取政策： German Research Foundation, UK Engineering and Physical Sciences Research …
Synthesizing efficiently monitorable formulas in metric temporal logic
R Raha, R Roy, N Fijalkow, D Neider, GA Pérez
International Conference on Verification, Model Checking, and Abstract …, 2023
强制性开放获取政策： Research Foundation (Flanders), German Research Foundation
The bridge between regular cost functions and omega-regular languages
T Colcombet, N Fijalkow
ICALP, 43rd International Colloquium on Automata, Languages, and Programming, 2016
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, European Commission
Quantifying bounds in strategy logic
N Fijalkow, B Maubert, A Murano, S Rubin
CSL, 32nd EACSL Annual Conference on Computer Science Logic 23, 2018
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, European Commission
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
A Casares, T Colcombet, N Fijalkow, K Lehtinen
TheoretiCS 3, 2024
强制性开放获取政策： European Commission, Agence Nationale de la Recherche
Lower bounds for arithmetic circuits via the Hankel matrix
N Fijalkow, G Lagarde, P Ohlmann, O Serre
computational complexity 30, 1-60, 2021
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, Agence Nationale de …
Profinite techniques for probabilistic automata and the Markov Monoid algorithm
N Fijalkow
Theoretical Computer Science 680, 1-14, 2017
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
Monadic Second-Order Logic with Arbitrary Monadic Predicates
N Fijalkow, C Paperman
ACM Transactions on Computational Logic 18 (3), 1-17, 2017
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
LTL learning on GPUS
M Valizadeh, N Fijalkow, M Berger
International Conference on Computer Aided Verification, 209-231, 2024
强制性开放获取政策： Agence Nationale de la Recherche
Public and Private Affairs in Strategic Reasoning
N Fijalkow, B Maubert, A Murano, S Rubin, M Vardi
KR, International Conference on Principles of Knowledge Representation and …, 2022
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定