The following pages link to (Q4168086):
Displayed 7 items.
- A note on the sufficiency of Sokolowski's criterion for context-free languages (Q1169297) (← links)
- On satisfying the LL-iteration theorem (Q1172400) (← links)
- The context-freeness of the languages associated with vector addition systems is decidable (Q1193880) (← links)
- Ogden's lemma for nonterminal bounded languages (Q3768421) (← links)
- (Q3873564) (← links)
- Comparisons between some pumping conditions for context-free languages (Q4729382) (← links)
- On languages satisfying “interchange Lemma” (Q5286056) (← links)