A1 Refereed original research article in a scientific journal
A decision method for Parikh slenderness of context-free languages
Authors: Honkala J
Publisher: ELSEVIER SCIENCE BV
Publication year: 1997
Journal: Discrete Applied Mathematics
Journal name in source: DISCRETE APPLIED MATHEMATICS
Journal acronym: DISCRETE APPL MATH
Volume: 73
Issue: 1
First page : 1
Last page: 4
Number of pages: 4
ISSN: 0166-218X
DOI: https://doi.org/10.1016/S0166-218X(96)00023-6
Abstract
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.
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.
Turun yliopiston Tutkimustietojärjestelmän portaali