Abstract
We investigate reachability problems on different types of labeled graphs constrained to formal languages from a family \(\mathcal{L}\). If every language in \(\mathcal{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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V.: Indexed grammars–An extension of context-free grammars. J. ACM 15, 647–671 (1968)
Allender, E., Barrington, D.A.M., Chakraborty, T., Datta, S., Roy, S.: Planar and grid graph reachability problems. Theoret. Comput. Sci. 45, 675–723 (2009)
Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)
Barrett, C.L., Jacob, R., Marathe, M.V.: Formal-language-constrained path problems. SIAM J. Comput. 30, 809–837 (2000)
Beeri, C.: Two-way nested stack automata are equivalent to two-way stack automata. J. Comput. System Sci. 10 (1975)
Blum, M., Kozen, D.: On the power of the compass (or, why mazes are easier to search than graphs). In: Symposium on Foundations of Computer Science (FOCS 1978), pp. 132–142. IEEE, Los Alamitos (1978)
Brandt, F., Fischer, F.A., Holzer, M.: On iterated dominance, matrix elimination, and matched paths. In: Symposium on Theoretical Aspects of Computer Science (STACS 2010). LIPIcs, vol. 5, pp. 107–118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
Cook, S.A.: Characterizations of pushdown machines in terms of time-bounded computers. J. ACM 18, 4–18 (1971)
Dassow, J., Lange, K.J.: Computational calculus and hardest languages of automata with abstract storages. In: Budach, L. (ed.) FCT 1991. LNCS, vol. 529, pp. 200–209. Springer, Heidelberg (1991)
Engelfriet, J., Hoogeboom, H.J.: Automata with storage on infinite words. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol. 372, pp. 289–303. Springer, Heidelberg (1989)
Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, Oxford (1995)
Holzer, M., McKenzie, P.: Alternating and empty alternating auxiliary stack automata. Theoret. Comput. Sci. (1-3), 307–326 (2003)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Ibarra, O.H.: Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata. J. Comput. System Sci. 5, 88–117 (1971)
Jenner, B., Kirsig, B.: Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata. RAIRO Inform. Theor. 23, 87–99 (1989)
Jones, N.D., Lien, Y.E., Laaser, W.T.: New problems complete for nondeterministic log space. Math. Systems Theory 10, 1–17 (1976)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Reingold, O.: Undirected connectivity in log-space. J. ACM 55, 1–24 (2008)
Ruzzo, W.L.: Complete pushdown languages (1979), http://www.cs.washington.edu/homes/ruzzo/papers/complete-pushdown-languages.pdf
Sudborough, I.H.: On the Tape Complexity of Deterministic Context-Free Languages. J. ACM 25, 405–414 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holzer, M., Kutrib, M., Leiter, U. (2011). Nodes Connected by Path Languages. In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-22321-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22320-4
Online ISBN: 978-3-642-22321-1
eBook Packages: Computer ScienceComputer Science (R0)