A decidability proof for bisimulation equivalence of first-order grammars is given. It is an alternative proof for a result by Sénizergues (1998, 2005) that subsumes his affirmative solution of the famous decidability question for deterministic pushdown automata. The presented proof is conceptually simpler, and a particular novelty is that it is not given as two semidecision procedures but it provides an explicit algorithm that might be amenable to a complexity analysis.

中文翻译：

---

通过一阶语法实现下推自动机的等价性

给出了一阶语法的双仿真等价性的可判定性证明。这是Sénizergues（1998，2005）的结果的另一种证明，该结果包含了他对确定性下推自动机的著名可判定性问题的肯定解决方案。提出的证明在概念上更简单，并且特别新颖的是，它不是作为两个半判决过程给出的，而是提供了一种可能适用于复杂性分析的显式算法。