Consensus Game Acceptors
From MaRDI portal
Publication:3451093
DOI10.1007/978-3-319-21500-6_8zbMath1386.68084OpenAlexW3104077620MaRDI QIDQ3451093
Marie van den Bogaard, Dietmar Berwanger
Publication date: 10 November 2015
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21500-6_8
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Information tracking in games on graphs
- Context-sensitive string languages and recognizable picture languages
- Recognizable picture languages and domino tiling
- Domino-tiling games
- Distributed synthesis is simply undecidable
- Non-erasing Variants of the Chomsky–Schützenberger Theorem
- Alternating-time temporal logic
- Alternation
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- On the (High) Undecidability of Distributed Synthesis Problems
- Quasi-realtime languages
- Classes of languages and linear-bounded automata
- Lower bounds for multiplayer noncooperative games of incomplete information