Pages that link to "Item:Q2409577"
From MaRDI portal
The following pages link to A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577):
Displaying 7 items.
- Model-checking process equivalences (Q477208) (← links)
- 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)
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (Q2272985) (← links)
- A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata (Q3327736) (← links)
- (Q4673421) (← links)
- (Q4708592) (← links)