Tight bounds for reachability problems on one-counter and pushdown systems
Work
Year: 2021
Type: article
Abstract: We consider the problem of reachability on One-Counter Systems (OCSs) and Pushdown Systems (PDSs). The problem has a well-known O(n3) bound on both models, while the bound is believed to be tight for ... more
Source: Information Processing Letters
Institution Aarhus University
Cites: 23
Cited by: 5
Related to: 10
FWCI: 0.528
Citation percentile (by year/subfield): 85.27
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Peace, justice, and strong institutions
Open Access status: hybrid
APC paid (est): $2,200