A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Undecidability Results for Bisimilarity on Prefix Rewrite Systems
[chapter]
2006
Lecture Notes in Computer Science
We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996 Stirling ( , 1998 proved the decidability of bisimilarity for normed pushdown processes. This result was substantially extended by Sénizergues (1998 Sénizergues ( , 2005 who showed the decidability for regular (or equational) graphs of finite out-degree (which include unnormed pushdown processes). The question of decidability of bisimilarity for a
doi:10.1007/11690634_19
fatcat:pmekz42wwjdbrdz7hlaqh7bd3q