The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable

Details The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable

2005-06-06

arxiv.org/abs/cs/0506014v1

Computer Science

Logic in Computer Science

Scientific paper

It is decidable for deterministic MSO definable graph-to-string or
graph-to-tree transducers whether they are equivalent on a context-free set of
graphs.

Affiliated with

Also associated with

No associations

Rating

The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-202062