Pages that link to "Item:Q5684249"

The following pages link to Real-Time Strict Deterministic Languages (Q5684249):

Displaying 22 items.

• 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)
• Constructing a realtime deterministic pushdown automaton from a grammar (Q1051440) (← links)
• Some results on subclass containment problems for special classes of dpda's related to nonsingular machines (Q1060563) (← links)
• A pumping lemma for real-time deterministic context-free languages (Q1081309) (← links)
• Iteration theorems for families of strict deterministic languages (Q1143811) (← links)
• The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine (Q1158757) (← links)
• The equivalence problem for LL- and LR-regular grammars (Q1162821) (← links)
• A hierarchy of real-time deterministic languages and their equivalence (Q1165588) (← links)
• The inclusion problem for simple languages (Q1235014) (← links)
• Normal forms of deterministic grammars (Q1238425) (← links)
• On LR(k) grammars and languages (Q1239009) (← links)
• A left part theorem for grammatical trees (Q1251905) (← 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 new foundation for finitary corecursion and iterative algebras (Q2304521) (← links)
• Strict deterministic grammars (Q2560718) (← links)
• A New Foundation for Finitary Corecursion (Q2811335) (← links)
• Decidable subcases of the equivalence problem for recursive program schemes (Q3773319) (← links)
• (Q3922198) (← links)
• On jump-deterministic pushdown automata (Q4141220) (← links)