Pages that link to "Item:Q988552"
From MaRDI portal
The following pages link to On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552):
Displaying 9 items.
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict (Q1124364) (← links)
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (Q2272985) (← 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)
- (Q4558784) (← links)
- Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence. (Q4608615) (← links)
- (Q4673421) (← links)
- (Q4708592) (← links)