A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
On Parikh slender context-free languages
Tekijät: Honkala J
Kustantaja: ELSEVIER SCIENCE BV
Julkaisuvuosi: 2001
Journal: Theoretical Computer Science
Tietokannassa oleva lehden nimi: THEORETICAL COMPUTER SCIENCE
Lehden akronyymi: THEOR COMPUT SCI
Vuosikerta: 255
Numero: 1-2
Aloitussivu: 667
Lopetussivu: 677
Sivujen määrä: 11
ISSN: 0304-3975
DOI: https://doi.org/10.1016/S0304-3975(00)00393-5
Tiivistelmä
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.
Turun yliopiston Tutkimustietojärjestelmän portaali