The following pages link to Strict deterministic grammars (Q2560718):
Displayed 41 items.
- Deterministic finite automata with recursive calls and DPDAs (Q1014418) (← links)
- Constructing a realtime deterministic pushdown automaton from a grammar (Q1051440) (← links)
- A pumping lemma for real-time deterministic context-free languages (Q1081309) (← links)
- A survey of normal form covers for context-free grammars (Q1132639) (← links)
- A hierarchy of deterministic languages (Q1136238) (← links)
- A representation of trees by languages. II (Q1137390) (← links)
- Iteration theorems for families of strict deterministic languages (Q1143811) (← links)
- DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
- The equivalence problem for LL- and LR-regular grammars (Q1162821) (← links)
- On LLP(k) parsers (Q1162825) (← links)
- A hierarchy of real-time deterministic languages and their equivalence (Q1165588) (← links)
- On LLP(k) grammars and languages (Q1166936) (← links)
- An improved bound for detecting looping configurations in deterministic PDA's (Q1214756) (← links)
- Attributed translations (Q1218732) (← links)
- Normal forms of deterministic grammars (Q1238425) (← links)
- Equivalence problems for deterministic context-free languages and monadic recursion schemes (Q1238426) (← links)
- On LR(k) grammars and languages (Q1239009) (← links)
- Economy of description by parsers, DPDA's, and PDA's (Q1239011) (← links)
- On the covering of parsable grammars (Q1239012) (← links)
- Characteristic parsing: A framework for producing compact deterministic parsers. I (Q1240564) (← links)
- Characteristic parsing: A framework for producing compact deterministic parsers. II (Q1240565) (← links)
- Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition (Q1240575) (← links)
- A representation of trees by languages. I (Q1246271) (← links)
- \(\omega\)-computations on deterministic pushdown machines (Q1247962) (← links)
- A left part theorem for grammatical trees (Q1251905) (← links)
- Two decidability results for deterministic pushdown automata (Q1254241) (← links)
- On equivalence of grammars through transformation trees (Q1259173) (← links)
- Simple chain grammars and languages (Q1259175) (← links)
- Recursion induction principle revisited (Q1838286) (← links)
- A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (Q1838320) (← links)
- Equivalence of deterministic pushdown automata revisited (Q2458041) (← links)
- (Q3335012) (← links)
- Epsilon weak precedence grammars and languages (Q3479532) (← links)
- An axiomatic approach to the Korenjak-Hopcroft algorithms (Q3703289) (← links)
- Decidable subcases of the equivalence problem for recursive program schemes (Q3773319) (← links)
- (Q3873564) (← links)
- (Q3922198) (← links)
- Sur une propriété d'itération des langages algébriques déterministes (Q3925891) (← links)
- Simple context-free languages and free monadic recursion schemes (Q4139703) (← links)
- On jump-deterministic pushdown automata (Q4141220) (← links)
- Decidability of DPDA equivalence (Q5941060) (← links)