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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The Theory of Universal Graphs for Infinite Duration Games ⋮ Unnamed Item ⋮ Token Games and History-Deterministic Quantitative-Automata ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular languages of thin trees
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- On alternating \(\omega\)-automata
- The modal mu-calculus alternation hierarchy is strict
- Entanglement and the complexity of directed graphs
- Bisimulation invariant monadic-second order logic in the finite
- Robust worst cases for parity games algorithms
- Taming past LTL and flat counter systems
- Solving Parity Games Using an Automata-Based Algorithm
- Weak Kripke Structures and LTL
- Recursive algorithm for parity games requires exponential time
- The Descriptive Complexity of Parity Games
- Weak alternating automata are not that weak
- Solving Games Without Determinization
- The Complexity of Tree Automata and Logics of Programs
- Alternating Tree Automata and Parity Games
- Automaton-Based Criteria for Membership in CTL
- On Independent Circuits Contained in a Graph
- Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction
- Testing and generating infinite sequences by a finite automaton
This page was built for publication:
