A1 Refereed original research article in a scientific journal

On Parikh slender context-free languages




AuthorsHonkala J

PublisherELSEVIER SCIENCE BV

Publication year2001

JournalTheoretical Computer Science

Journal name in sourceTHEORETICAL COMPUTER SCIENCE

Journal acronymTHEOR COMPUT SCI

Volume255

Issue1-2

First page 667

Last page677

Number of pages11

ISSN0304-3975

DOIhttps://doi.org/10.1016/S0304-3975(00)00393-5


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.



Last updated on 2024-26-11 at 14:25