Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
From MaRDI portal
Publication:5756723
DOI10.1007/11821069_56zbMath1132.68498OpenAlexW1528783056MaRDI QIDQ5756723
Sławomir Lasota, Wojciech Rytter
Publication date: 5 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11821069_56
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items
Partially-Commutative Context-Free Processes ⋮ Complexity of deciding bisimilarity between normed BPA and normed BPP ⋮ Selected Ideas Used for Decidability and Undecidability of Bisimilarity ⋮ Normed BPA vs. Normed BPP Revisited ⋮ Partially-commutative context-free processes: expressibility and tractability ⋮ The complexity of compressed membership problems for finite automata ⋮ Unification with Singleton Tree Grammars