Recognizable Graph Languages for Checking Invariants

  title={Recognizable Graph Languages for Checking Invariants},
  author={Christoph Blume and H. J. Sander Bruggink and Barbara K{\"o}nig},
We generalize the order-theoretic variant of the Myhill-Nerode theorem to graph languages, and characterize the recognizable graph languages as the class of languages for which the Myhill-Nerode quasi order is a well quasi order. In the second part of the paper we restrict our attention to graphs of bounded interface size, and use Myhill-Nerode quasi orders to verify that, for such bounded graphs, a recognizable graph property is an invariant of a graph transformation system. A recognizable… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 12 extracted citations

Similar Papers

Loading similar papers…