A decision method for Parikh slenderness of context-free languages

: Honkala J

Publisher: ELSEVIER SCIENCE BV

: 1997

: Discrete Applied Mathematics

: DISCRETE APPLIED MATHEMATICS

: DISCRETE APPL MATH

: 73

: 1

: 4

: 0166-218X

DOI: https://doi.org/10.1016/S0166-218X(96)00023-6

In a recent paper we introduced Parikh slender languages as a generalization of slender languages defined and studied by Andrasiu, Dassow, Paun 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.