Nathanaël Fijalkow

Available identifiers

zbMath Open fijalkow.nathanaelMaRDI QIDQ529061

List of research outcomes

Publication	Date of Publication	Type
Playing Safe, Ten Years Later	2024-03-11	Paper
https://portal.mardi4nfdi.de/entity/Q5874194	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5874295	2023-02-07	Paper
A robust class of linear recurrence sequences	2022-12-08	Paper
The Theory of Universal Graphs for Infinite Duration Games	2022-10-06	Paper
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games	2022-07-18	Paper
Quantifying Bounds in Strategy Logic	2022-05-28	Paper
https://portal.mardi4nfdi.de/entity/Q5028432	2022-02-09	Paper
Probabilistic automata of bounded ambiguity	2022-01-06	Paper
Lower bounds for arithmetic circuits via the Hankel matrix	2021-11-24	Paper
https://portal.mardi4nfdi.de/entity/Q4964720	2021-03-03	Paper
The theory of universal graphs for games: past and future	2021-02-22	Paper
The State Complexity of Alternating Automata	2021-01-20	Paper
Controlling a random population	2020-09-23	Paper
Trace Refinement in Labelled Markov Decision Processes	2020-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q5111437	2020-05-27	Paper
Probabilistic Automata of Bounded Ambiguity	2020-05-27	Paper
Lower bounds for the state complexity of probabilistic languages and the language of prime numbers	2020-04-29	Paper
Universal graphs and good for games automata: new tools for infinite duration games	2020-01-28	Paper
On the decidability of reachability in linear time-invariant systems	2019-10-22	Paper
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games	2019-10-15	Paper
Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem	2019-08-27	Paper
https://portal.mardi4nfdi.de/entity/Q4967235	2019-07-03	Paper
Expressiveness of probabilistic modal logics: a gradual approach	2019-05-29	Paper
Timed comparisons of semi-Markov processes	2018-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q4636627	2018-04-19	Paper
On the Decidability of Reachability in Linear Time-Invariant Systems	2018-02-19	Paper
Characterisation of an Algebraic Algorithm for Probabilistic Automata	2018-01-24	Paper
The Bridge Between Regular Cost Functions and Omega-Regular Languages	2017-12-19	Paper
Irregular behaviours for probabilistic automata	2017-10-27	Paper
Monadic Second-Order Logic with Arbitrary Monadic Predicates	2017-10-16	Paper
Stamina: stabilisation monoids in automata theory	2017-08-22	Paper
The Online Space Complexity of Probabilistic Languages	2017-07-21	Paper
Profinite techniques for probabilistic automata and the Markov monoid algorithm	2017-05-18	Paper
Deciding the Value 1 Problem for Probabilistic Leaktight Automata	2017-05-16	Paper
Playing Safe	2017-04-25	Paper
Emptiness Of Alternating Tree Automata Using Games With Imperfect Information	2017-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q2958522	2017-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q2957486	2017-01-26	Paper
Trace Refinement in Labelled Markov Decision Processes	2016-06-10	Paper
ACME: Automata with Counters, Monoids and Equivalence	2015-12-17	Paper
Trading Bounds for Memory in Games with Counters	2015-11-04	Paper
Deciding the value 1 problem for probabilistic leaktight automata	2015-08-25	Paper
Two Recursively Inseparable Problems for Probabilistic Automata	2014-10-14	Paper
Monadic Second-Order Logic with Arbitrary Monadic Predicates	2014-10-14	Paper
Parity and Streett Games with Costs	2014-07-31	Paper
Finitary Languages	2011-06-03	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Nathanaël Fijalkow