A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
A decision method for Parikh slenderness of context-free languages
Tekijät: Honkala J
Kustantaja: ELSEVIER SCIENCE BV
Julkaisuvuosi: 1997
Journal: Discrete Applied Mathematics
Tietokannassa oleva lehden nimi: DISCRETE APPLIED MATHEMATICS
Lehden akronyymi: DISCRETE APPL MATH
Vuosikerta: 73
Numero: 1
Aloitussivu: 1
Lopetussivu: 4
Sivujen määrä: 4
ISSN: 0166-218X
DOI: https://doi.org/10.1016/S0166-218X(96)00023-6
Tiivistelmä
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