On Parikh slender context-free languages



: Honkala J

Publisher: ELSEVIER SCIENCE BV

: 2001

 Theoretical Computer Science

: THEORETICAL COMPUTER SCIENCE

: THEOR COMPUT SCI

: 255

: 1-2

: 667

: 677

: 11

: 0304-3975

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


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 26/11/2024 02:25:31 PM