Pages that link to "Item:Q3682403"

The following pages link to Optimality of a Two-Phase Strategy for Routing in Interconnection Networks (Q3682403):

Displaying 20 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)
• Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642) (← links)
• A representation of trees by languages. II (Q1137390) (← links)
• Achievable high scores of \(\varepsilon\)-moves and running times in DPDA computations (Q1143812) (← 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)
• Deterministic one-counter automata (Q1218272) (← links)
• A result on the equivalence problem for deterministic pushdown automata (Q1230509) (← links)
• The inclusion problem for simple languages (Q1235014) (← links)
• A direct algorithm for checking equivalence of LL(k) grammars (Q1238431) (← links)
• Economy of description by parsers, DPDA's, and PDA's (Q1239011) (← links)
• A representation of trees by languages. I (Q1246271) (← links)
• On equivalence and subclass containment problems for deterministic context-free languages (Q1251906) (← links)
• A note on non-singular deterministic pushdown automata (Q1252037) (← links)
• A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (Q1838320) (← links)
• Towards a better understanding of pure packet routing (Q5060094) (← links)