Pages that link to "Item:Q1816326"
From MaRDI portal
The following pages link to Decidability of the equivalence problem for deterministic pushdown automata (Q1816326):
Displaying 27 items.
- Decidability of equivalence of symbolic derivations (Q437031) (← links)
- A criterion for the decidability of the \(A\)-completeness problem for definite automata (Q656372) (← links)
- Decision problems for pushdown threads (Q884992) (← links)
- Decidability of the reachability problem for pushdown relational automata (Q1057653) (← links)
- Decidability of the equivalence problem for synchronous deterministic pushdown-store automata (Q1062450) (← links)
- A weaker sufficient condition for the equivalence of a pair of DPDA's to be decidable (Q1075060) (← links)
- Simple reductions between \(D0L\) language and sequence equivalence problems (Q1208490) (← links)
- Decidability of behavioural equivalence in unary PCF (Q1285665) (← links)
- On the determinacy problem for two-way pushdown automata (Q1342261) (← links)
- One unresolvable algorithmic problem (Q1357929) (← links)
- An unsolvable algorithmic problem of deterministic push-down automatons (Q1360771) (← links)
- Complete formal systems for equivalence problems (Q1575907) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- The extended equivalence problem for a class of non-real-time deterministic pushdown automata (Q1894681) (← links)
- Equivalence of pushdown automata via first-order grammars (Q2208249) (← links)
- Language equivalence of probabilistic pushdown automata (Q2252520) (← links)
- Equivalence of deterministic pushdown automata revisited (Q2458041) (← links)
- On the decidability of the PVD class with equality (Q2743641) (← 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)
- Decidable subcases of the equivalence problem for recursive program schemes (Q3773319) (← links)
- (Q3813316) (← links)
- The equivalence problem for deterministic pushdown automata is decidable (Q4571996) (← links)
- (Q4708592) (← links)
- DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA (Q4786328) (← links)
- Equivalences of Pushdown Systems Are Hard (Q5410661) (← links)
- Decidability of DPDA equivalence (Q5941060) (← links)
