A1 Refereed original research article in a scientific journal
On Parikh slender context-free languages
Authors: Honkala J
Publisher: ELSEVIER SCIENCE BV
Publication year: 2001
Journal: Theoretical Computer Science
Journal name in source: THEORETICAL COMPUTER SCIENCE
Journal acronym: THEOR COMPUT SCI
Volume: 255
Issue: 1-2
First page : 667
Last page: 677
Number of pages: 11
ISSN: 0304-3975
DOI: https://doi.org/10.1016/S0304-3975(00)00393-5(external)
Abstract
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.
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.
UTU Research Portal