Shortest Paths in One-Counter Systems
From MaRDI portal
Publication:2811358
DOI10.1007/978-3-662-49630-5_27zbMath1475.68147arXiv1510.05460OpenAlexW2215731810MaRDI QIDQ2811358
Piotr Hofman, Michael Wehar, Wojciech Czerwiński, Michał Pilipczuk, Dmitry Chistikov
Publication date: 10 June 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.05460
Related Items (8)
Countdown games, and simulation on (succinct) one-counter nets ⋮ Rational index of languages with bounded dimension of parse trees ⋮ Unnamed Item ⋮ Shortest accepted strings for two-way finite automata: approaching the \(2^n\) lower bound ⋮ Bounded Context Switching for Valence Systems ⋮ On the Length of Shortest Strings Accepted by Two-way Finite Automata ⋮ Unnamed Item ⋮ Shortest Paths in One-Counter Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The rational index of the Dyck language \(D_ 1^{'*}\)
- Rational indexes of generators of the cone of context-free languages
- Automatic verification of recursive procedures with one integer parameter.
- Langages à un compteur
- Shortest Paths in One-Counter Systems
- Notes on counting with finite machines
- Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata
- The Reachability Problem over Infinite Graphs
- The Effects of Bounding Syntactic Resources on Presburger LTL
- Demystifying Reachability in Vector Addition Systems
- Decidability of Weak Simulation on One-Counter Nets
- Proofs that count
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- Equivalence of deterministic one-counter automata is NL-complete
- Term Rewriting and Applications
- Witness Runs for Counter Machines
- Reachability analysis of pushdown automata: Application to model-checking
This page was built for publication: Shortest Paths in One-Counter Systems
