Pages that link to "Item:Q3736917"
From MaRDI portal
The following pages link to An “Interchange Lemma” for Context-Free Languages (Q3736917):
Displaying 13 items.
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- Edge-label controlled graph grammars (Q909484) (← 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)
- Permutations are not context-free: An application of the interchange lemma (Q1165021) (← links)
- On the language of primitive words (Q1351946) (← links)
- Detecting leftmost maximal periodicities (Q1825029) (← links)
- Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata (Q2164011) (← links)
- Most pseudo-copy languages are not context-free (Q2695285) (← links)
- Properties of infinite words : Recent results (Q5096141) (← links)
- The range of non-linear natural polynomials cannot be context-free (Q5140468) (← links)
- On languages satisfying “interchange Lemma” (Q5286056) (← links)
- Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)