The definability of equational graphs in monadic second-order logic

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Article 01 Jan 1989Publisher:Springer Berlin Heidelberg

Authors: Bruno Courcelle;

doi: 10.1007/bfb0035762

The definability of equational graphs in monadic second-order logic

- Summary
- Metrics

Abstract

We establish that every equational graph can be characterized, up to isomorphism, by a formula of monadic second-order logic. It follows that the isomorphism of two equational graphs is decidable. Equational graphs can be used to describe the behaviour of recursive applicative program schemes. We obtain a sufficient and decidable condition for the equivalence of these program schemes.

Related Organizations

University of Bordeaux
France
University of Bordeaux
France

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	4
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average