Pages that link to "Item:Q1259173"

The following pages link to On equivalence of grammars through transformation trees (Q1259173):

Displaying 15 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)
• Fundamental properties of infinite trees (Q1055184) (← 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)
• Attribute grammars and recursive program schemes. I. II (Q1162363) (← links)
• The equivalence problem for LL- and LR-regular grammars (Q1162821) (← links)
• Complete formal systems for equivalence problems (Q1575907) (← links)
• \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
• \(L(A)=L(B)\)? A simplified decidability proof. (Q1603704) (← 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)
• The extended equivalence problem for a class of non-real-time deterministic pushdown automata (Q1894681) (← links)
• The inclusion problem for some subclasses of context-free languages (Q1978515) (← links)
• A fast algorithm to decide on the equivalence of stateless DPDA (Q5286053) (← links)