The following pages link to Jakub Michaliszyn (Q2009650):
Displaying 25 items.
- Non-deterministic weighted automata evaluated over Markov chains (Q2009651) (← links)
- Learning infinite-word automata with loop-index queries (Q2124472) (← links)
- ``Most of'' leads to undecidability: failure of adding frequencies to LTL (Q2233396) (← links)
- Modal Logics Definable by Universal Three-Variable Formulas (Q2911630) (← links)
- Elementary Modal Logics over Transitive Structures (Q2958545) (← links)
- Decidable Elementary Modal Logics (Q2986825) (← links)
- B and D Are Enough to Make the Halpern–Shoham Logic Undecidable (Q3587452) (← links)
- Decidability of the Guarded Fragment with the Transitive Closure (Q3638100) (← links)
- Satisfiability versus Finite Satisfiability in Elementary Modal Logics (Q4611207) (← links)
- Two-Variable Universal Logic with Transitive Closure (Q4649561) (← links)
- (Q4986511) (← links)
- (Q4999312) (← links)
- Non-deterministic Weighted Automata on Random Words (Q5009422) (← links)
- Average Stack Cost of Büchi Pushdown Automata (Q5136334) (← links)
- (Q5136335) (← links)
- (Q5155690) (← links)
- On the Decidability of Elementary Modal Logics (Q5277903) (← links)
- (Q5283018) (← links)
- The Undecidability of the Logic of Subintervals (Q5415296) (← links)
- (Q5419895) (← links)
- (Q5875378) (← links)
- Two-Variable First-Order Logic with Equivalence Closure (Q5892437) (← links)
- Two-Variable First-Order Logic with Equivalence Closure (Q5895185) (← links)
- Deterministic weighted automata under partial observability (Q6545582) (← links)
- Learning deterministic visibly pushdown automata under accessible stack (Q6584078) (← links)
