Abstract
We investigate reachability problems on different types of labeled graphs constrained to formal languages from a family . If every language in is accepted by a one-way nondeterministic storage automaton, then we give an appealing characterization of the computational complexity of the labeled graph reachability problem in terms of two-way nondeterministic storage automata with auxiliary worktape that is logarithmic-space bounded. Moreover, we also consider acyclic graphs in the underlying reachability instance, obtaining a lower bound result for auxiliary storage automata that are simultaneously space and time restricted. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Holzer, M., Kutrib, M., & Leiter, U. (2011). Nodes connected by path languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6795 LNCS, pp. 276–287). https://doi.org/10.1007/978-3-642-22321-1_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
