Pages that link to "Item:Q2458041"
From MaRDI portal
The following pages link to Equivalence of deterministic pushdown automata revisited (Q2458041):
Displaying 17 items.
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
- A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict (Q1124364) (← links)
- One unresolvable algorithmic problem (Q1357929) (← links)
- An unsolvable algorithmic problem of deterministic push-down automatons (Q1360771) (← links)
- Decidability of the equivalence problem for deterministic pushdown automata (Q1816326) (← links)
- Equivalence of pushdown automata via first-order grammars (Q2208249) (← links)
- Equivalence checking of prefix-free transducers and deterministic two-tape automata (Q2278270) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- When input-driven pushdown automata meet reversiblity (Q2969982) (← links)
- (Q3033318) (← links)
- A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata (Q3327736) (← links)
- An axiomatic approach to the Korenjak-Hopcroft algorithms (Q3703289) (← links)
- (Q4673421) (← links)
- (Q4708592) (← links)
- Variations on pushdown machines (Detailed Abstract) (Q5402522) (← links)
- Equivalences of Pushdown Systems Are Hard (Q5410661) (← links)
- A Note on Pushdown Automata Systems (Q5496201) (← links)