Comparisons of Parikh's condition to other conditions for context-free languages

AbstractIn this paper we first compare Parikh's condition to various pumping conditions — Bar-Hillel's pumping lemma, Ogden's condition and Bader-Moura's condition; secondly, to interchange condition; and finally, to Sokolowski's and Grant's conditions. In order to carry out these comparisons we present some properties of Parikh's languages. The main result is the orthogonality of the previously mentioned conditions and Parikh's condition