Pages that link to "Item:Q5958326"

The following pages link to Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326):

Displaying 7 items.

• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
• The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
• Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
• Simulation preorder over simple process algebras (Q1854513) (← links)
• Complexity of deciding bisimilarity between normed BPA and normed BPP (Q1959482) (← links)
• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
• Normed BPA vs. Normed BPP Revisited (Q3541036) (← links)