Formal Language Constrained Path Problems

Download PDF
Open Webpage

Christopher L. Barrett, Riko Jacob, Madhav V. Marathe

Published: 1998, Last Modified: 21 Jan 2026SWAT 1998EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Given an alphabet σ, a (directed) graph G whose edges are weighted and σ-labeled, and a formal language L \(\subseteq\) σ*, we consider the problem of finding a shortest (simple) path p in G complying with the additional constraint that l(p) ∃ L. Here l(p) denotes the unique word given by concatenating the σ-labels in G along the path p.