Pages that link to "Item:Q5271086"
From MaRDI portal
The following pages link to Bisimilarity of Pushdown Automata is Nonelementary (Q5271086):
Displayed 5 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)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
- (Q4558784) (← links)