Weightreducing grammars and ultralinear languages

Ulrike Brandt; Ghislain Delepine; Hermann K.-G. Walter

RAIRO - Theoretical Informatics and Applications (2010)

  • Volume: 38, Issue: 1, page 19-25
  • ISSN: 0988-3754

Abstract

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

How to cite

top

Brandt, Ulrike, Delepine, Ghislain, and Hermann K.-G. Walter. "Weightreducing grammars and ultralinear languages." RAIRO - Theoretical Informatics and Applications 38.1 (2010): 19-25. <http://eudml.org/doc/92730>.

@article{Brandt2010,
abstract = { 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. },
author = {Brandt, Ulrike, Delepine, Ghislain, Hermann K.-G. Walter},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {Chomsky-grammars; weightfunctions; weightreducing grammars; emptiness problem; ultralinear languages.},
language = {eng},
month = {3},
number = {1},
pages = {19-25},
publisher = {EDP Sciences},
title = {Weightreducing grammars and ultralinear languages},
url = {http://eudml.org/doc/92730},
volume = {38},
year = {2010},
}

TY - JOUR
AU - Brandt, Ulrike
AU - Delepine, Ghislain
AU - Hermann K.-G. Walter
TI - Weightreducing grammars and ultralinear languages
JO - RAIRO - Theoretical Informatics and Applications
DA - 2010/3//
PB - EDP Sciences
VL - 38
IS - 1
SP - 19
EP - 25
AB - 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.
LA - eng
KW - Chomsky-grammars; weightfunctions; weightreducing grammars; emptiness problem; ultralinear languages.
UR - http://eudml.org/doc/92730
ER -

References

top
  1. B. Brainerd, An Analoge of a Theorem about Contextfree Languages. Inform. Control11 (1968).  
  2. S. Ginsburg and E.H. Spanier, Finite-Turn Pushdown Automata. J. SIAM Control4 (1966).  
  3. S. Ginsburg and E.H. Spanier, Derivation – bounded languages. J. Comput. Syst. Sci.2 (1968).  
  4. J. Gruska, A Few Remarks on the Index of Contextfree Grammars and Languages. Inform. Control19 (1971)  
  5. M.A. Harrison, Introduction to Formal Language Theory. Addison-Wesley Pub. Co. (1978).  
  6. A. Salomaa, Formal Languages. Academic Press, New York (1973).  

NotesEmbed ?

top

You must be logged in to post comments.