Shortest Paths in One-Counter Systems
نویسندگان
چکیده
We show that any one-counter automaton with n states, if its language is non-empty, accepts some word of length at most O(n). This closes the gap between the previously known upper bound of O(n) and lower bound of Ω(n). More generally, we prove a tight upper bound on the length of shortest paths between arbitrary configurations in onecounter transition systems. Weaker bounds have previously appeared in the literature, and our result offers an improvement.
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملShortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks
A problem studied in Systems Biology is how to find shortest paths in metabolic networks. Unfortunately, simple (i.e., graph theoretic) shortest paths do not properly reflect biochemical facts. An approach to overcome this issue is to use edge labels and search for paths with distinct labels. In this paper, we show that such biologically feasible shortest paths are hard to compute. Moreover, we...
متن کاملSOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملA real-time traffic control scheme of multiple AGV systems for collision free minimum time motion: a routing table approach
A two-staged traffic control scheme, in which sets of candidate paths are prepared off-line prior to overall motion planning process, has been widely adopted for motion planning of mobile robots, but relatively little attention has been given to the application of the two-staged scheme to multiple automated guided vehicle systems (MAGVS’s). In this paper, a systematic two-staged traffic control...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کامل