Pages that link to "Item:Q1822521"

The following pages link to Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521):

Displaying 9 items.

• The finiteness of synchronous, tabled picture languages is decidable (Q860893) (← links)
• 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)
• Deterministic versus nondeterministic space in terms of synchronized alternating machines (Q1334670) (← 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)
• (Q3191604) (← links)
• (Q5507064) (← links)
• Semisimple synchronizing automata and the Wedderburn-Artin theory (Q5890812) (← links)