Consensus Game Acceptors and Iterated Transductions
From MaRDI portal
Publication:4640036
DOI10.1142/S0129054118400026zbMath1387.68152arXiv1501.07131MaRDI QIDQ4640036
Marie van den Bogaard, Dietmar Berwanger
Publication date: 15 May 2018
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.07131
Cites Work
- Information tracking in games on graphs
- Context-sensitive string languages and recognizable picture languages
- Recognizable picture languages and domino tiling
- Domino-tiling games
- Non-erasing Variants of the Chomsky–Schützenberger Theorem
- Alternating-time temporal logic
- Alternation
- Iteration of rational transductions
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- On the (High) Undecidability of Distributed Synthesis Problems
- Classes of languages and linear-bounded automata
- Lower bounds for multiplayer noncooperative games of incomplete information
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item