Hostname: page-component-84b7d79bbc-x5cpj Total loading time: 0 Render date: 2024-07-25T06:21:20.006Z Has data issue: false hasContentIssue false
  • English
  • Français

Weightreducing grammars and ultralinear languages

Published online by Cambridge University Press:  15 March 2004

Ulrike Brandt ,
Ghislain Delepine  and
Hermann K.-G. Walter
Ulrike Brandt
Affiliation:
University of Technology, Darmstadt Department of Computer Science, Germany; brandt@iti.informatik.tu-darmstadt.de., walter@iti.informatik.tu-darmstadt.de., gdelepine@yahoo.fr.
Ghislain Delepine
Affiliation:
University of Technology, Darmstadt Department of Computer Science, Germany; brandt@iti.informatik.tu-darmstadt.de., walter@iti.informatik.tu-darmstadt.de., gdelepine@yahoo.fr.
Hermann K.-G. Walter
Affiliation:
University of Technology, Darmstadt Department of Computer Science, Germany; brandt@iti.informatik.tu-darmstadt.de., walter@iti.informatik.tu-darmstadt.de., gdelepine@yahoo.fr.
Get access

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.

Keywords

Chomsky-grammarsweightfunctionsweightreducing grammarsemptiness problemultralinear languages.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 38 , Issue 1 , January 2004 , pp. 19 - 25
Copyright
© EDP Sciences, 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

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