On Parikh slender context-free languages
In a recent paper we defined 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. (C) 2001 Elsevier Science B.V. All rights reserved.
context-free languages parikh slender languages bounded languages