scientific article; zbMATH DE number 1361133
From MaRDI portal
Publication:4270070
zbMath0939.68082MaRDI QIDQ4270070
Publication date: 20 December 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (4)
Complexity of Weak Bisimilarity and Regularity for BPA and BPP ⋮ Decidability of Weak Bisimilarity for a Subset of BPA ⋮ Deciding bisimulation-like equivalences with finite-state processes ⋮ On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
This page was built for publication:
