摘要：In a recent paper we introduced Parikh slender languages and series as a generalization of slender languages defined and studied by Andrasiu, Dassow, Paun and Salomaa. Results concerning Parikh slender series can be applied in ambiguity proofs of context-free languages. In this paper an algorithm is presented for deciding whether or not a given N-algebraic series is Parikh slender.
