Jakub Michaliszyn

Available identifiers

zbMath Open michaliszyn.jakubMaRDI QIDQ2009650

List of research outcomes

Publication	Date of Publication	Type
Learning deterministic visibly pushdown automata under accessible stack	2024-08-06	Paper
Deterministic weighted automata under partial observability	2024-05-29	Paper
https://portal.mardi4nfdi.de/entity/Q5875378	2023-02-03	Paper
Learning infinite-word automata with loop-index queries	2022-04-11	Paper
``Most of leads to undecidability: failure of adding frequencies to LTL	2021-10-18	Paper
https://portal.mardi4nfdi.de/entity/Q5155690	2021-10-08	Paper
Non-deterministic Weighted Automata on Random Words	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4999312	2021-07-06	Paper
https://portal.mardi4nfdi.de/entity/Q4986511	2021-04-27	Paper
https://portal.mardi4nfdi.de/entity/Q5136335	2020-11-25	Paper
Average Stack Cost of Büchi Pushdown Automata	2020-11-25	Paper
Non-deterministic weighted automata evaluated over Markov chains	2019-11-29	Paper
Satisfiability versus Finite Satisfiability in Elementary Modal Logics	2019-01-17	Paper
https://portal.mardi4nfdi.de/entity/Q5283018	2017-07-18	Paper
On the Decidability of Elementary Modal Logics	2017-07-12	Paper
Two-Variable First-Order Logic with Equivalence Closure	2017-05-16	Paper
Decidable Elementary Modal Logics	2017-05-16	Paper
Elementary Modal Logics over Transitive Structures	2017-02-02	Paper
Two-Variable First-Order Logic with Equivalence Closure	2014-09-18	Paper
https://portal.mardi4nfdi.de/entity/Q5419895	2014-06-11	Paper
The Undecidability of the Logic of Subintervals	2014-05-12	Paper
Two-Variable Universal Logic with Transitive Closure	2012-11-22	Paper
Modal logics definable by universal three-variable formulas	2012-08-31	Paper
B and D Are Enough to Make the Halpern–Shoham Logic Undecidable	2010-09-07	Paper
Decidability of the Guarded Fragment with the Transitive Closure	2009-07-14	Paper

Research outcomes over time

This page was built for person: Jakub Michaliszyn