Leftist grammars and the chomsky hierarchy
In: FCT 2005 : fundamentals of computationals theory (Lübeck, 17-20 August 2005)Lecture notes in computer science :293-304
Konferenz
- print, 10 ref
Zugriff:
Leftist grammars can be characterized in terms of rules of the form a → ba and cd → d, without distinction between terminals and nonterminals. They were introduced by Motwani et. al. [9], where the accessibility problem for some general protection system was related to the membership problem of these grammars. This protection system was originally proposed in [3,10] in the context of Java virtual worlds. We show that the set of languages defined by general leftist grammars is not included in CFL, answering in negative a question from [9]. Moreover, we relate some restricted but naturally defined variants of leftist grammars to the language classes of the Chomsky hierarchy.
Titel: |
Leftist grammars and the chomsky hierarchy
|
---|---|
Autor/in / Beteiligte Person: | JURDZINSKI, Tomasz ; LORYS, Krzysztof |
Link: | |
Quelle: | FCT 2005 : fundamentals of computationals theory (Lübeck, 17-20 August 2005)Lecture notes in computer science :293-304 |
Veröffentlichung: | Berlin: Springer, 2005 |
Medientyp: | Konferenz |
Umfang: | print, 10 ref |
ISSN: | 0302-9743 (print) |
Schlagwort: |
|
Sonstiges: |
|