A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In a recent paper we deÿned and studied Parikh slender languages and showed that they can be used in simplifying ambiguity proofs of context-free languages. In this paper Parikh slender context-free languages are characterized. The characterization has diverse applications.doi:10.1016/s0304-3975(00)00393-5 fatcat:rptfvqxqlbcofetape6aar5hyq