Pages that link to "Item:Q1351456"

The following pages link to A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456):

Displaying 39 items.

• Space-efficient scheduling of stochastically generated tasks (Q418125) (← links)
• Partially-commutative context-free processes: expressibility and tractability (Q532392) (← links)
• On the computational complexity of bisimulation, redux (Q703845) (← links)
• Prime normal form and equivalence of simple grammars (Q860856) (← links)
• Equivalence of simple functions (Q880171) (← links)
• 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)
• Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
• Effective decomposability of sequential behaviours (Q1575536) (← links)
• Complete formal systems for equivalence problems (Q1575907) (← links)
• \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← 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)
• Compression techniques in group theory (Q2117795) (← links)
• Equivalence of pushdown automata via first-order grammars (Q2208249) (← links)
• Language equivalence of probabilistic pushdown automata (Q2252520) (← links)
• Bisimulation and coinduction enhancements: a historical perspective (Q2280213) (← 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)
• Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
• Inter-procedural Two-Variable Herbrand Equalities (Q2802449) (← links)
• Parallel Identity Testing for Skew Circuits with Big Powers and Applications (Q2946414) (← links)
• COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA (Q3056281) (← links)
• Partially-Commutative Context-Free Processes (Q3184678) (← links)
• Equality Testing of Compressed Strings (Q3449353) (← links)
• Grammar-Based Tree Compression (Q3451087) (← links)
• REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE (Q3503088) (← 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)
• (Q4222868) (← links)
• Parallel identity testing for skew circuits with big powers and applications (Q4687480) (← links)
• Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028) (← links)
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
• High undecidability of weak bisimilarity for Petri nets (Q5096742) (← links)
• Deciding the Bisimilarity of Context-Free Session Types (Q5164167) (← 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)
• Polymorphic higher-order context-free session types (Q6499549) (← links)