Complexity of weak bisimilarity and regularity for BPA and BPP
DOI10.1017/S0960129503003992zbMath1088.68134OpenAlexW1975081600MaRDI QIDQ4461214
Publication date: 30 March 2004
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129503003992
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: Complexity of weak bisimilarity and regularity for BPA and BPP