Two-Buffer Simulation Games
Milka Hutagalung (University of Kassel, Germany), Norbert Hundeshagen, (University of Kassel, Germany), Dietrich Kuske (Technische Universit\"at, Ilmenau, Germany), Martin Lange (University of Kassel, Germany), Etienne, Lozes (LSV, ENS Cachan, CNRS, France)
TL;DR
This paper investigates two-buffer simulation games on Büchi automata, exploring their decidability and complexity, and demonstrates their application in approximating language inclusion problems for finite transducers and rational relations over infinite words.
Contribution
It introduces and analyzes two-buffer simulation games, extending previous single-buffer models to better approximate language inclusion problems for automata and transducers.
Findings
Games with two buffers can approximate language inclusion problems.
Decidability and complexity results for two-buffer games are established.
Application to rational relations over infinite words is demonstrated.
Abstract
We consider simulation games played between Spoiler and Duplicator on two Buchi automata in which the choices made by Spoiler can be buffered by Duplicator in two different buffers before she executes them on her structure. Previous work on such games using a single buffer has shown that they are useful to approximate language inclusion problems. We study the decidability and complexity and show that games with two buffers can be used to approximate corresponding problems on finite transducers, i.e. the inclusion problem for rational relations over infinite words.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.