A decision method for Parikh slenderness of context-free languages

In a recent paper we introduced Parikh slender languages as a generalization of slender languages defined and studied by Andraşiu, Dassow, Pǎun and Salomaa. Results concerning Parikh slender languages can be applied in ambiguity proofs of context-free languages. In this paper an algorithm is presented for deciding whether or not a given context-free language is Parikh slender.