Decidability of Bisimulation Equivalence for
Petr Janÿcar · 2011
A self-contained proof of the decidability of bisimulation equivalence for first-order grammars is given. This provides an alternative for Senizergues' decidability proof (1998,2005) for nondeterministic pushdown automata with deterministic popping -steps, which generalized his decidability proof for language equivalence of deter- ministic pushdown automata.