Weightreducing grammars and ultralinear languages

Weightreducing grammars and ultralinear languages

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:RAIRO. Informatique théorique et applications 2004-01, Vol.38 (1), p.19-25
Hauptverfasser: Brandt, Ulrike, Delepine, Ghislain, Hermann K.-G. Walter
Format: Artikel
Sprache:eng
Schlagworte:
68Q45
Applied sciences
Chomsky-grammars
Computer science
control theory
systems
emptiness problem
Exact sciences and technology
Language theory and syntactical analysis
Theoretical computing
ultralinear languages
weightfunctions
weightreducing grammars
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0988-3754
1290-385X
DOI:10.1051/ita:2004001