Pages that link to "Item:Q2908855"
From MaRDI portal
The following pages link to Fast equivalence-checking for normed context-free processes (Q2908855):
Displaying 9 items.
- Partially-commutative context-free processes: expressibility and tractability (Q532392) (← links)
- A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456) (← links)
- On deciding readiness and failure equivalences for processes (Q1892874) (← links)
- Deciding branching bisimilarity of normed context-free processes ls in \(\sum_ 2^ p\) (Q1892892) (← links)
- Equivalence of pushdown automata via first-order grammars (Q2208249) (← links)
- Language equivalence of probabilistic pushdown automata (Q2252520) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
- Deciding the Bisimilarity of Context-Free Session Types (Q5164167) (← links)