@article{Senizergues:SIAM-JoC:2005,
Abstract = {The bisimulation problem for equational graphs of finite out-degree is shown to be decidable. We reduce this problem to the \$\eta\$-bisimulation problem for deterministic rational (vectors of) boolean series on the alphabet of a deterministic pushdown automaton \${\cal M}\$. We then exhibit a complete formal system for deducing equivalent pairs of such vectors.},
Author = {S\'{e}nizergues, G\'{e}raud},
EPrint = {https://doi.org/10.1137/S0097539700377256},
File = {The Bisimulation Problem for Equational Graphs of Finite Out-Degree - s0097539700377256.pdf},
Journal = {SIAM Journal on Computing},
Number = {5},
Pages = {1025--1106},
Title = {The Bisimulation Problem for Equational Graphs of Finite Out-Degree},
URL = {https://doi.org/10.1137/S0097539700377256},
Volume = {34},
Year = {2005},
bdsk-url-1 = {https://doi.org/10.1137/S0097539700377256},
date-added = {2023-08-10 11:50:06 +0200},
date-modified = {2023-08-10 11:50:28 +0200},
doi = {10.1137/S0097539700377256}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A