The Bisimulation Problem for equational graphs of finite out-degree

Simple item page
dc.creatorSenizergues, G.
dc.date2000-08-22
dc.date.accessioned2026-07-07T03:16:28Z
dc.date.available2026-07-07T03:16:28Z
dc.descriptionThe "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.
dc.description98 pages, 4 figures, submitted to JACM
dc.identifierhttps://arxiv.org/abs/cs/0008018
dc.identifierhttp://arxiv.org/abs/cs/0008018
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30366
dc.subjectLogic in Computer Science
dc.subjectDiscrete Mathematics
dc.subjectF.1.1;F.4.2;F.4.3;G.2.2
dc.titleThe Bisimulation Problem for equational graphs of finite out-degree
dc.typetext

Files

Collections

arXiv