Reachability on prefix-recognizable graphs

https://doi.org/10.1016/j.ipl.2008.04.008Get rights and content

Abstract

We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability.

References (14)

  • P. Jancar et al.

    A note on emptiness for alternating finite automata with a one-letter alphabet

    Inform. Process. Lett.

    (2007)
  • A. Bouajjani et al.

    Reachability analysis of pushdown automata: Application to model-checking

  • A. Blumensath et al.

    Finite presentations of infinite structures: Automata and interpretations

    Theory of Comput. Syst.

    (2004)
  • T. Cachat

    Uniform solution of parity games on prefix-recognizable graphs

    Electron. Notes Theor. Comput. Sci.

    (2002)
  • T. Cachat, I. Walukiewicz, The complexity of games on higher order pushdown automata, CoRR, abs/0705.0262,...
  • D. Caucal

    On infinite transition graphs having a decidable monadic theory

    Theoret. Comput. Sci.

    (2002)
  • A. Chandra et al.

    Alternation

    J. ACM

    (1981)
There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 2008 Elsevier B.V. All rights reserved.