scientific article; zbMATH DE number 7215285
From MaRDI portal
Publication:5114824
Publication date: 26 June 2020
Full work available at URL: https://arxiv.org/abs/1902.10654
Title of this publication is not available (Why is that?)
Cites Work
- Entanglement and the complexity of directed graphs
- Solving Parity Games Using an Automata-Based Algorithm
- The Complexity of Tree Automata and Logics of Programs
- On Independent Circuits Contained in a Graph
- Taming past LTL and flat counter systems
- Regular languages of thin trees
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Testing and generating infinite sequences by a finite automaton
- Title not available (Why is that?)
- Weak alternating automata are not that weak
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving Games Without Determinization
- The modal mu-calculus alternation hierarchy is strict
- The Descriptive Complexity of Parity Games
- On alternating \(\omega\)-automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternating Tree Automata and Parity Games
- Weak Kripke Structures and LTL
- Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction
- Bisimulation invariant monadic-second order logic in the finite
- Robust worst cases for parity games algorithms
- Recursive algorithm for parity games requires exponential time
- Automaton-Based Criteria for Membership in CTL
Cited In (8)
- Title not available (Why is that?)
- The Theory of Universal Graphs for Infinite Duration Games
- Title not available (Why is that?)
- Token Games and History-Deterministic Quantitative-Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parity games on temporal graphs
- Deposit games with reinvestment
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114824)
