可判定的PDA与不可判定的PDKEEPAAA的分界线
Dividing Line between Decidable PDA's and Undecidable Ones
摘要：
Senizergues已经证明了语言等价对于不相交的ε-确定性PDA是可判定的。Stirling证明了强双相似性对于PDA是可判定的。在消极的一面Srba证明，弱双相似性是不可判定的赋范PDA。后来，Jancar和Srba建立了不相交epsilon-pushing PDA和不相交epsilon-popping PDA的弱双相似性的不可判定性。本文推广了这些可判定性和不可判定性结果。扩展是通过查看PDA的几个变体的分支双相似性的等价性检查问题来完成的。
英文摘要：
Senizergues has proved that language equivalence is decidable for disjoint epsilon-deterministic PDA. Stirling has showed that strong bisimilarity is decidable for PDA. On the negative side Srba demonstrated that the weak bisimilarity is undecidable for normed PDA. Later Jancar and Srba established the undecidability of the weak bisimilarity for disjoint epsilon-pushing PDA and disjoint epsilon-popping PDA. These decidability and undecidability results are extended in the present paper. The extension is accomplished by looking at the equivalence checking issue for the branching bisimilarity of several variants of PDA.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
