A short proof of the decidability of bisimulation for normed bpa-processes
- 25 May 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 42 (3) , 167-171
- https://doi.org/10.1016/0020-0190(92)90142-i
Abstract
No abstract availableThis publication has 1 reference indexed in Scilit:
- Graphes canoniques de graphes algébriquesRAIRO - Theoretical Informatics and Applications, 1990