No CrossRef data available.
Article contents
Weightreducing grammars and ultralinear languages
Published online by Cambridge University Press: 15 March 2004
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
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2004
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).