The Bisimulation Problem for equational graphs of finite out-degree

Details The Bisimulation Problem for equational graphs of finite out-degree The Bisimulation Problem for equational graphs of finite out-degree

2000-08-22

arxiv.org/abs/cs/0008018v1

Computer Science

Logic in Computer Science

98 pages, 4 figures, submitted to JACM

Scientific paper

The "bisimulation problem" for equational graphs of finite out-degree is
shown to be decidable. We reduce this problem to the bisimulation problem for
deterministic rational (vectors of) boolean series on the alphabet of a dpda M.
We then exhibit a complete formal system for deducing equivalent pairs of such
vectors.

Affiliated with

Also associated with

No associations

Rating

The Bisimulation Problem for equational graphs of finite out-degree 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 Bisimulation Problem for equational graphs of finite out-degree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Bisimulation Problem for equational graphs of finite out-degree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-134023