Checking History-Determinism is NP-hard for Parity Automata
Gespeichert in:
| Veröffentlicht in: | International Conference on Foundations of Software Science and Computation Structures (27. : 2024 : Luxemburg Stadt) Foundations of software science and computation structures ; Part 1 |
|---|---|
| 1. Verfasser: | |
| Pages: | 1 |
| Format: | UnknownFormat |
| Sprache: | eng |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Tag hinzufügen | Titel | Jahr | Verfasser |
|---|---|---|
| Ackermannian Completion of Separators | 2024 | Leroux, Jérôme |
| Drawing from an Urn is Isometric | 2024 | Jacobs, Bart |
| Determinization of Integral Discounted-Sum Automata is Decidable | 2024 | Almagor, Shaull |
| Tighter Construction of Tight Büchi Automata | 2024 | Jankola, Marek |
| Synthesis with Privacy Against an Observer | 2024 | Kupferman, Orna |
| Fair ω-Regular Games | 2024 | Hausmann, Daniel |
| Checking History-Determinism is NP-hard for Parity Automata | 2024 | Prakash, Aditya |
| Symbolic Solution of Emerson-Lei Games for Reactive Synthesis | 2024 | Hausmann, Daniel |
| Parity Games on Temporal Graphs | 2024 | Austin, Pete |
| Monoidal Extended Stone Duality | 2024 | Birkmann, Fabian |
| Enriching Diagrams with Algebraic Operations | 2024 | Villoria, Alejandro |
| Towards a Compositional Framework for Convex Analysis (with Applications to Probability Theory) | 2024 | Stein, Dario |
| Stochastic Window Mean-Payoff Games | 2024 | Doyen, Laurent |