Graphs and Decidable Transductions based on Edge Constraints
Nils Klarlund and Michael I. Schwartzbach February 1994 |

## Abstract:We give examples to show that not even To overcome this
problem, we use monadic second-order logic and introduce Our main result is that for certain transformations of graphs definable in monadic second-order logic, the question of whether a graph family given by a specification is mapped to a family given by a specification is decidable. Thus a decidable Hoare logic arises.
Available as |

Last modified: 2003-06-08 by webmaster.