Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Formal Languages and Automata Theory

arXiv:1608.00654 (cs)
[Submitted on 2 Aug 2016]

Title:Two-Buffer Simulation Games

Authors:Milka Hutagalung (University of Kassel, Germany), Norbert Hundeshagen (University of Kassel, Germany), Dietrich Kuske (Technische Universität Ilmenau, Germany), Martin Lange (University of Kassel, Germany), Etienne Lozes (LSV, ENS Cachan and CNRS, France)
View PDF
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.
Comments: In Proceedings Cassting'16/SynCoP'16, arXiv:1608.00177
Subjects: Formal Languages and Automata Theory (cs.FL); Computer Science and Game Theory (cs.GT)
Cite as: arXiv:1608.00654 [cs.FL]
  (or arXiv:1608.00654v1 [cs.FL] for this version)
  https://doi.org/10.48550/arXiv.1608.00654
Journal reference: EPTCS 220, 2016, pp. 27-38
Related DOI: https://doi.org/10.4204/EPTCS.220.3

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Tue, 2 Aug 2016 00:36:32 UTC (22 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.FL
< prev   |   next >
new | recent | 2016-08
Change to browse by:
cs
cs.GT

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)