RAIRO-Theor. Inf. Appl.
Volume 38, Number 1, January-March 2004
|Page(s)||19 - 25|
|Published online||15 March 2004|
Weightreducing grammars and ultralinear languages
University of Technology, Darmstadt Department of Computer Science, Germany; firstname.lastname@example.org.,
Accepted: 7 November 2003
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.
Mathematics Subject Classification: 68Q45
Key words: Chomsky-grammars / weightfunctions / weightreducing grammars / emptiness problem / ultralinear languages.
© EDP Sciences, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.