Filip Mazowiecki

Available identifiers

zbMath Open mazowiecki.filipMaRDI QIDQ1622947

List of research outcomes

Publication	Date of Publication	Type
The boundedness and zero isolation problems for weighted automata over nonnegative rationals	2024-12-06	Paper
The complexity of soundness in workflow nets	2024-12-06	Paper
Coverability in VASS revisited: improving Rackoff's bound to obtain conditional optimality	2024-11-14	Paper
On rational recursive sequences	2024-10-08	Paper
On polynomial recursive sequences	2024-10-07	Paper
https://portal.mardi4nfdi.de/entity/Q6192488	2024-02-12	Paper
Fast termination and workflow nets	2024-02-01	Paper
Coverability in 2-VASS with one unary counter is in NP	2023-11-24	Paper
https://portal.mardi4nfdi.de/entity/Q5874194	2023-02-07	Paper
Continuous One-counter Automata	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5875390	2023-02-03	Paper
The Reachability Problem for Petri Nets Is Not Elementary	2022-12-08	Paper
A robust class of linear recurrence sequences	2022-12-08	Paper
Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations	2022-12-07	Paper
Dynamic data structures for timed automata acceptance	2022-10-27	Paper
https://portal.mardi4nfdi.de/entity/Q5089315	2022-07-18	Paper
Monadic Datalog and Regular Tree Pattern Queries	2021-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q5155668	2021-10-08	Paper
https://portal.mardi4nfdi.de/entity/Q5155662	2021-10-08	Paper
https://portal.mardi4nfdi.de/entity/Q5009428	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5002806	2021-07-28	Paper
Weak Cost Register Automata are Still Powerful	2021-04-19	Paper
When are emptiness and containment decidable for probabilistic automata?	2021-04-14	Paper
https://portal.mardi4nfdi.de/entity/Q5144629	2021-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q3304149	2020-08-05	Paper
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One	2020-05-27	Paper
The reachability problem for Petri nets is not elementary	2020-01-30	Paper
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems	2019-11-22	Paper
Copyless cost-register automata: structure, expressiveness, and closure properties	2019-05-02	Paper
Weak cost register automata are still powerful	2018-11-22	Paper
Decidability of weak logics with deterministic transitive closure	2018-04-23	Paper
Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties	2018-01-24	Paper
Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata	2017-08-31	Paper
Complexity of Two-Variable Logic on Finite Trees	2017-07-13	Paper
Eliminating Recursion from Monadic Datalog Programs on Trees	2015-09-16	Paper
Monadic Datalog and Regular Tree Pattern Queries	2014-10-14	Paper
Complexity of Two-Variable Logic on Finite Trees	2013-08-07	Paper

Research outcomes over time

This page was built for person: Filip Mazowiecki