Pages that link to "Item:Q1249046"
From MaRDI portal
The following pages link to A method for proving programming languages non context-free (Q1249046):
Displaying 7 items.
- On context-free and Szilard languages (Q794440) (← 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)
- A note on the sufficiency of Sokolowski's criterion for context-free languages (Q1169297) (← links)
- Extensions of sokolowski's theorem to prove languages are not context free or not regular (Q3957965) (← links)
- Comparisons between some pumping conditions for context-free languages (Q4729382) (← links)
- On languages satisfying “interchange Lemma” (Q5286056) (← links)
