Nathanaël Fijalkow

From MaRDI portal
Person:529061

Available identifiers

zbMath Open fijalkow.nathanaelMaRDI QIDQ529061

List of research outcomes





PublicationDate of PublicationType
New algorithms for combinations of objectives using separating automata2024-12-06Paper
How to play optimally for regular objectives?2024-11-14Paper
From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism2024-07-03Paper
On the Monniaux problem in abstract interpretation2024-04-19Paper
Playing Safe, Ten Years Later2024-03-11Paper
Scalable anytime algorithms for learning fragments of linear temporal logic2024-01-23Paper
https://portal.mardi4nfdi.de/entity/Q58741942023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58742952023-02-07Paper
A robust class of linear recurrence sequences2022-12-08Paper
The Theory of Universal Graphs for Infinite Duration Games2022-10-06Paper
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games2022-07-18Paper
Quantifying Bounds in Strategy Logic2022-05-28Paper
https://portal.mardi4nfdi.de/entity/Q50284322022-02-09Paper
Probabilistic automata of bounded ambiguity2022-01-06Paper
Lower bounds for arithmetic circuits via the Hankel matrix2021-11-24Paper
https://portal.mardi4nfdi.de/entity/Q49647202021-03-03Paper
The theory of universal graphs for games: past and future2021-02-22Paper
The State Complexity of Alternating Automata2021-01-20Paper
Controlling a random population2020-09-23Paper
Trace Refinement in Labelled Markov Decision Processes2020-06-26Paper
Probabilistic Automata of Bounded Ambiguity2020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51114372020-05-27Paper
Lower bounds for the state complexity of probabilistic languages and the language of prime numbers2020-04-29Paper
Universal graphs and good for games automata: new tools for infinite duration games2020-01-28Paper
On the decidability of reachability in linear time-invariant systems2019-10-22Paper
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games2019-10-15Paper
Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem2019-08-27Paper
https://portal.mardi4nfdi.de/entity/Q49672352019-07-03Paper
Expressiveness of probabilistic modal logics: a gradual approach2019-05-29Paper
Timed comparisons of semi-Markov processes2018-06-26Paper
https://portal.mardi4nfdi.de/entity/Q46366272018-04-19Paper
On the Decidability of Reachability in Linear Time-Invariant Systems2018-02-19Paper
Characterisation of an Algebraic Algorithm for Probabilistic Automata2018-01-24Paper
The Bridge Between Regular Cost Functions and Omega-Regular Languages2017-12-19Paper
Irregular behaviours for probabilistic automata2017-10-27Paper
Monadic Second-Order Logic with Arbitrary Monadic Predicates2017-10-16Paper
Stamina: stabilisation monoids in automata theory2017-08-22Paper
The Online Space Complexity of Probabilistic Languages2017-07-21Paper
Profinite techniques for probabilistic automata and the Markov monoid algorithm2017-05-18Paper
Deciding the Value 1 Problem for Probabilistic Leaktight Automata2017-05-16Paper
Playing Safe2017-04-25Paper
Emptiness Of Alternating Tree Automata Using Games With Imperfect Information2017-02-21Paper
https://portal.mardi4nfdi.de/entity/Q29585222017-02-02Paper
https://portal.mardi4nfdi.de/entity/Q29574862017-01-26Paper
Trace Refinement in Labelled Markov Decision Processes2016-06-10Paper
ACME: Automata with Counters, Monoids and Equivalence2015-12-17Paper
Trading Bounds for Memory in Games with Counters2015-11-04Paper
Deciding the value 1 problem for probabilistic leaktight automata2015-08-25Paper
Monadic Second-Order Logic with Arbitrary Monadic Predicates2014-10-14Paper
Two Recursively Inseparable Problems for Probabilistic Automata2014-10-14Paper
Parity and Streett Games with Costs2014-07-31Paper
Finitary languages2011-06-03Paper

Research outcomes over time

This page was built for person: Nathanaël Fijalkow