Weightreducing grammars and ultralinear languages
Ulrike Brandt, Ghislain Delepine, Hermann K.-G. Walter (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We exhibit a new class of grammars with the help of weightfunctions. They are characterized by decreasing the weight during the derivation process. A decision algorithm for the emptiness problem is developed. This class contains non-contextfree grammars. The corresponding language class is identical to the class of ultralinear languages.