Pages that link to "Item:Q1158757"

The following pages link to The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine (Q1158757):

Displaying 7 items.

• On some decision questions concerning pushdown machines (Q593781) (← links)
• New families of non real time dpda's and their decidability results (Q799385) (← links)
• An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
• Some results on subclass containment problems for special classes of dpda's related to nonsingular machines (Q1060563) (← links)
• Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages (Q1120292) (← links)
• The extended equivalence problem for a class of non-real-time deterministic pushdown automata (Q1894681) (← links)
• Decidable subcases of the equivalence problem for recursive program schemes (Q3773319) (← links)