A sufficient condition for erasing productions to be avoidable

Authors:
Georg Zetzsche
Affiliations:
Fachbereich Informatik, Technische Universität Kaiserslautern, Kaiserslautern, Germany
Venue:
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Year:
2011

Citing 5
Cited 0

Grammars with controlled derivations

Handbook of formal languages, vol. 2
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
Sequential grammars and automata with valances

Theoretical Computer Science
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
On erasing productions in random context grammars

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In each grammar model, it is an important question whether erasing productions are necessary to generate all languages. Using the concept of grammars with control languages by Salomaa, which offers a uniform treatment of a variety of grammar models, we present a condition on the class of control languages that guarantees that erasing productions are avoidable in the resulting grammar model. On the one hand, this generalizes the previous result that in Petri net controlled grammars, erasing productions can be eliminated. On the other hand, it allows us to infer that the same is true for vector grammars.