Pages that link to "Item:Q1158772"
From MaRDI portal
The following pages link to On the decidability of equivalence for deterministic pushdown transducers (Q1158772):
Displaying 6 items.
- Equivalence of simple functions (Q880171) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines (Q1094140) (← 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)
- Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521) (← links)
