The Bisimulation Problem for equational graphs of finite out-degree
<|reference_start|>The Bisimulation Problem for equational graphs of finite out-degree: The "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.<|reference_end|>
@article{senizergues2000the,
    title={The Bisimulation Problem for equational graphs of finite out-degree},
    author={G. Senizergues},
    journal={arXiv preprint arXiv:cs/0008018},
    year={2000},
    archivePrefix={arXiv},
    eprint={cs/0008018},
    primaryClass={cs.LO cs.DM}
}