Deciding Bisimilarity is P-Complete

José L. Balcázar, Joaquim Gabarró, Miklos Santha. Deciding Bisimilarity is P-Complete. Formal Asp. Comput., 4(6A):638-648, 1992.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.