Pages that link to "Item:Q3140021"

The following pages link to Decidability of bisimulation equivalence for process generating context-free languages (Q3140021):

Displaying 45 items.

• Nested semantics over finite trees are equationally hard (Q598202) (← links)
• On the computational complexity of bisimulation, redux (Q703845) (← links)
• Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
• A note on an expressiveness hierarchy for multi-exit iteration (Q1014386) (← links)
• A complete equational axiomatization for MPA with string iteration (Q1274456) (← links)
• Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
• Context-free event domains are recognizable (Q1286370) (← links)
• A note on the complexity of deciding bisimilarity of normed unary processes (Q1331934) (← links)
• A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456) (← links)
• An equational axiomatization for multi-exit iteration (Q1369097) (← links)
• The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
• Effective decomposability of sequential behaviours (Q1575536) (← links)
• \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
• Algebraically complete semirings and Greibach normal form (Q1772777) (← 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)
• A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
• Decidable first-order transition logics for PA-processes (Q2575856) (← links)
• Model-Checking Games for Typed λ-Calculi (Q2864164) (← links)
• Regular Strategies as Proof Tactics for CIRC (Q2873678) (← links)
• Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
• A Context-Free Process as a Pushdown Automaton (Q3541013) (← links)
• On the Expressive Power of Restriction and Priorities in CCS with Replication (Q3617733) (← links)
• (Q4222868) (← links)
• Bisimulation equivalence is decidable for one-counter processes (Q4571985) (← links)
• Axiomatizations for the perpetual loop in process algebra (Q4571987) (← links)
• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (Q4715674) (← links)
• (Q4818834) (← links)
• (Q5014795) (← links)
• (Q5111633) (← links)
• Deciding the Bisimilarity of Context-Free Session Types (Q5164167) (← links)
• Reflections on a Geometry of Processes (Q5262964) (← links)
• Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) (← links)
• Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
• Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)
• Linearization in parallel pCRL (Q5946027) (← links)
• Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)
• Non-regular iterators in process algebra (Q5958616) (← links)
• Basic process algebra with deadlocking states (Q5958771) (← links)
• Infinite results (Q6104374) (← links)
• Polymorphic higher-order context-free session types (Q6499549) (← links)
• System \(F^\mu_\omega\) with context-free session types (Q6535246) (← links)
• Decidability results in automata and process theory (Q6560390) (← links)