A decision method for Parikh slenderness
โ
Juha Honkala
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 218 KB
In a recent paper we introduced Parikh slender languages as a generalization of slender languages defined and studied by AndraSiu, Dassow, Pgun and Salomaa. Results concerning Pa&h slender languages can be applied in ambiguity proofs of context-free languages. In this paper an algorithm is presented