scientific article; zbMATH DE number 1231553
From MaRDI portal
Publication:4222868
zbMath0911.68151MaRDI QIDQ4222868
Publication date: 20 December 1998
Full work available at URL: http://www.elsevier.com/cas/tree/store/tcs/free/noncas/pc/volume5.htm#hirsh
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
An algebra of behavioural types ⋮ Complexity of Weak Bisimilarity and Regularity for BPA and BPP ⋮ Decidability of Weak Bisimilarity for a Subset of BPA ⋮ Weak bisimilarity and regularity of context-free processes is EXPTIME-hard ⋮ On the computational complexity of bisimulation, redux ⋮ Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time ⋮ Decidability of bisimulation equivalence for normed pushdown processes
Cites Work
This page was built for publication:
