Elsevier

Theoretical Computer Science

Volume 131, Issue 2, 12 September 1994, Pages 441-448
Theoretical Computer Science

Note
A note on the complexity of deciding bisimilarity of normed unary processes

https://doi.org/10.1016/0304-3975(94)90183-XGet rights and content
Under an Elsevier user license
open archive

Abstract

We give NC1 reduction of bisimulation equivalence for (general) normed context-free processes to the same problem for normed unary context-free processes.

Cited by (0)