ACM - Normas
Wojciech Czerwinski
Petr Jancar
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
Decidability of branching bisimulation on normed commutative context-free processes
Checking equality and regularity for normed BPA with silent moves
Branching bisimilarity checking for PRS
Branching bisimilarity is decidable for context-free processes", Proc
Deciding branching bimiliarity of normed context-free processes is in ? p 2
Complexity of weak bisimilarity and regularity for BPA and BPP