Pages that link to "Item:Q1239606"

The following pages link to An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines (Q1239606):

Displaying 21 items.

• A logic for programming with complex objects (Q686642) (← 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 decision problems about controlled rewriting systems (Q910246) (← links)
• About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
• On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
• Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages (Q1120292) (← links)
• A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
• Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642) (← links)
• The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine (Q1158757) (← links)
• On the decidability of equivalence for deterministic pushdown transducers (Q1158772) (← links)
• DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
• Tree equivalence of linear recursive schemata is polynomial-time decidable (Q1162152) (← links)
• The tree equivalence of linear recursion schemes (Q1575234) (← 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)
• A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (Q1838320) (← links)
• It is decidable whether a monadic thue system is canonical over a regular set (Q3210188) (← links)
• Decidable subcases of the equivalence problem for recursive program schemes (Q3773319) (← links)
• The equivalence problem for deterministic pushdown automata is decidable (Q4571996) (← links)
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)