Nodes connected by path languages

Authors:
Markus Holzer;Martin Kutrib;Ursula Leiter
Affiliations:
Institut für Informatik, Universität Giessen, Giessen, Germany;Institut für Informatik, Universität Giessen, Giessen, Germany;Institut für Informatik, Universität Giessen, Giessen, Germany
Venue:
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Year:
2011

Citing 15
Cited 0

Limits to parallel computation: P-completeness theory

Limits to parallel computation: P-completeness theory
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Formal-Language-Constrained Path Problems

SIAM Journal on Computing
Automata with Storage on Infinite Words

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Computational Calculus and Hardest Languages of Automata with Abstract Storages

FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Alternating and empty alternating auxiliary stack automata

Theoretical Computer Science
Principles of Model Checking (Representation and Mind Series)

Principles of Model Checking (Representation and Mind Series)
On the power of the compass (or, why mazes are easier to search than graphs)

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Undirected connectivity in log-space

Journal of the ACM (JACM)
Planar and Grid Graph Reachability Problems

Theory of Computing Systems - Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea Sorbi
Two-way nested stack automata are equivalent to two-way stack automata

Journal of Computer and System Sciences
Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate reachability problems on different types of labeled graphs constrained to formal languages from a family L. If every language in L 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.