Pages that link to "Item:Q1838320"

The following pages link to A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (Q1838320):

Displaying 4 items.

• An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
• New techniques for proving the decidability of equivalence problem (Q913523) (← links)
• Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521) (← links)
• The extended equivalence problem for a class of non-real-time deterministic pushdown automata (Q1894681) (← links)