Pages that link to "Item:Q5410661"
From MaRDI portal
The following pages link to Equivalences of Pushdown Systems Are Hard (Q5410661):
Displayed 7 items.
- Equivalence of pushdown automata via first-order grammars (Q2208249) (← links)
- Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence (Q2301358) (← links)
- On long words avoiding Zimin patterns (Q2321925) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Trace Inclusion for One-Counter Nets Revisited (Q3447702) (← links)
- (Q4558784) (← links)
- The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes (Q5277914) (← links)