Pages that link to "Item:Q3569030"

The following pages link to An elementary bisimulation decision procedure for arbitrary context-free processes (Q3569030):

Displaying 19 items.

• On the computational complexity of bisimulation, redux (Q703845) (← links)
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
• Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← 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)
• Complexity of deciding bisimilarity between normed BPA and normed BPP (Q1959482) (← links)
• Bisimilarity on basic parallel processes (Q2072066) (← links)
• Equivalence of pushdown automata via first-order grammars (Q2208249) (← links)
• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
• Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
• Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
• Deciding Bisimilarity of Full BPA Processes Locally (Q3540084) (← links)
• Normed BPA vs. Normed BPP Revisited (Q3541036) (← links)
• Deciding the Bisimilarity of Context-Free Session Types (Q5164167) (← links)
• Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) (← links)
• Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
• Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)
• Basic process algebra with deadlocking states (Q5958771) (← links)
• Polymorphic higher-order context-free session types (Q6499549) (← links)