[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
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:2210.10084 (cs)
[Submitted on 18 Oct 2022 (v1), last revised 22 Nov 2022 (this version, v3)]

Title:On History-Deterministic One-Counter Nets

Authors:Aditya Prakash, K. S. Thejaswini
View PDF
Abstract:We consider the model of history-deterministic one-counter nets (OCNs). History-determinism is a property of transition systems that allows for a limited kind of non-determinism which can be resolved 'on-the-fly'. Token games, which have been used to characterise history-determinism over various models, also characterise history-determinism over OCNs. By reducing 1-token games to simulation games, we are able to show that checking for history-determinism of OCNs is decidable. Moreover, we prove that this problem is PSPACE-complete for a unary encoding of transitions, and EXPSPACE-complete for a binary encoding.
We then study the language properties of history-deterministic OCNs. We show that the resolvers of non-determinism for history-deterministic OCNs are eventually periodic. As a consequence, for a given history-deterministic OCN, we construct a language equivalent deterministic one-counter automaton. We also show the decidability of comparing languages of history-deterministic OCNs, such as language inclusion and language universality.
Comments: Fixed some typos, and minor inaccuracies in the proof of lemma 19. Redefined 'simulates' to be consistent with the literature
Subjects: Formal Languages and Automata Theory (cs.FL)
ACM classes: F.4.3
Cite as: arXiv:2210.10084 [cs.FL]
  (or arXiv:2210.10084v3 [cs.FL] for this version)
  https://doi.org/10.48550/arXiv.2210.10084

Submission history

From: Aditya Prakash [view email]
[v1] Tue, 18 Oct 2022 18:27:03 UTC (1,019 KB)
[v2] Thu, 20 Oct 2022 00:16:35 UTC (1,018 KB)
[v3] Tue, 22 Nov 2022 17:14:30 UTC (922 KB)
Full-text links:

Access Paper:

license icon view license
Current browse context:
cs.FL
< prev   |   next >
new | recent | 2022-10
Change to browse by:
cs

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?)