Consensus game acceptors
From MaRDI portal
Recommendations
Cites work
- Alternating-time temporal logic
- Alternation
- Classes of languages and linear-bounded automata
- Context-sensitive string languages and recognizable picture languages
- Distributed synthesis is simply undecidable
- Domino-tiling games
- Elements of automata theory. Translated from the French by Reuben Thomas
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Games, puzzles, and computation
- scientific article; zbMATH DE number 1048047 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Information tracking in games on graphs
- Lower bounds for multiplayer noncooperative games of incomplete information
- Non-erasing Variants of the Chomsky–Schützenberger Theorem
- Nondeterministic controllers of nondeterministic processes
- On the (High) Undecidability of Distributed Synthesis Problems
- Quasi-realtime languages
- Recognizable picture languages and domino tiling
Cited in
(2)
This page was built for publication: Consensus game acceptors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451093)