The following pages link to (Q4673421):
Displaying 9 items.
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Generalizations of checking stack automata: characterizations and hierarchies (Q1622991) (← links)
- Complexity of deciding bisimilarity between normed BPA and normed BPP (Q1959482) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems (Q2482725) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata (Q3327736) (← links)
- Normed BPA vs. Normed BPP Revisited (Q3541036) (← links)
- (Q4708592) (← links)