Pages that link to "Item:Q1238431"

The following pages link to A direct algorithm for checking equivalence of LL(k) grammars (Q1238431):

Displaying 9 items.

• Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
• An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
• Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642) (← links)
• The equivalence problem for LL- and LR-regular grammars (Q1162821) (← links)
• A direct algorithm for checking equivalence of LL(k) grammars (Q1238431) (← links)
• On equivalence of grammars through transformation trees (Q1259173) (← 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)
• A fast algorithm to decide on the equivalence of stateless DPDA (Q5286053) (← links)