Pages that link to "Item:Q1822521"
From MaRDI portal
The following pages link to Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521):
Displaying 4 items.
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict (Q1124364) (← 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)
