On history-deterministic one-counter nets
From MaRDI portal
Publication:6091193
DOI10.1007/978-3-031-30829-1_11arXiv2210.10084OpenAlexW4366503827MaRDI QIDQ6091193
K. S. Thejaswini, Aditya Prakash
Publication date: 24 November 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.10084
Cites Work
- Reachability in succinct one-counter games
- EXPSPACE-complete variant of countdown games, and simulation on succinct one-counter nets
- A note on emptiness for alternating finite automata with a one-letter alphabet
- Simulation Problems Over One-Counter Nets
- Forms of Determinism for Automata (Invited Talk)
- Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete
- Width of Non-deterministic Automata
- Trace Inclusion for One-Counter Nets Revisited
- On Determinisation of Good-for-Games Automata
- Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
- Solving Games Without Determinization
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- How Deterministic are Good-For-Games Automata?
- Decidability of Weak Simulation on One-Counter Nets
- Nondeterminism in the Presence of a Diverse or Unknown Future
- Equivalence of deterministic one-counter automata is NL-complete
- Automata with Reversal-Bounded Counters: A Survey
- Unambiguity in Automata Theory
- A Hierarchy of Nondeterminism
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
- History-deterministic timed automata are not determinizable
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On history-deterministic one-counter nets
