A1 Journal article – refereed
On Parikh slender context-free languages




List of 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 number: 255
Issue number: 1-2
ISSN: 0304-3975

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.


Internal Authors/Editors

Last updated on 2019-29-01 at 16:09