The following pages link to A Generalization of Ogden's Lemma (Q3967068):
Displaying 12 items.
- Regular and context-free pattern languages over small alphabets (Q391783) (← links)
- On context-free and Szilard languages (Q794440) (← links)
- Unbordered partial words (Q1028413) (← links)
- A pumping lemma for real-time deterministic context-free languages (Q1081309) (← links)
- The interchange or pump (di)lemmas for context-free languages (Q1104760) (← links)
- Comparisons of Parikh's condition to other conditions for context-free languages (Q1128989) (← links)
- Parikh’s Theorem and Descriptional Complexity (Q2891382) (← links)
- A pumping lemma for flip-pushdown languages (Q2969981) (← links)
- Comparisons between some pumping conditions for context-free languages (Q4729382) (← links)
- Properties of infinite words : Recent results (Q5096141) (← links)
- Gaining Power by Input Operations: Finite Automata and Beyond (Q5200048) (← links)
- UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES (Q5462115) (← links)
