Pages that link to "Item:Q5756723"
From MaRDI portal
The following pages link to Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes (Q5756723):
Displayed 7 items.
- Partially-commutative context-free processes: expressibility and tractability (Q532392) (← links)
- Complexity of deciding bisimilarity between normed BPA and normed BPP (Q1959482) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- Partially-Commutative Context-Free Processes (Q3184678) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- Normed BPA vs. Normed BPP Revisited (Q3541036) (← links)
- Unification with Singleton Tree Grammars (Q3636835) (← links)