On Parikh slender context-free languages
In: Theoretical computer science, Jg. 255 (2001), Heft 1-2, S. 667-677
Online
academicJournal
- print, 20 ref
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.
Titel: |
On Parikh slender context-free languages
|
---|---|
Autor/in / Beteiligte Person: | HONKALA, Juha |
Link: | |
Zeitschrift: | Theoretical computer science, Jg. 255 (2001), Heft 1-2, S. 667-677 |
Veröffentlichung: | Amsterdam: Elsevier, 2001 |
Medientyp: | academicJournal |
Umfang: | print, 20 ref |
ISSN: | 0304-3975 (print) |
Schlagwort: |
|
Sonstiges: |
|