Semi-linearity, Parikh-boundedness and tree adjunct languages (Q799121): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 11:05, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Semi-linearity, Parikh-boundedness and tree adjunct languages |
scientific article |
Statements
Semi-linearity, Parikh-boundedness and tree adjunct languages (English)
0 references
1983
0 references
A language L is called Parikh-bounded if there is a bounded language B contained in L such that for each x in L there exists y in B so that the commutative image of x is equal to that of y. \textit{M. Blattner} and \textit{M. Latteux} [Lect. Notes Comput. Sci. 115, 316-323 (1981; Zbl 0462.68057)] have proved that the class of context-free languages has the Parikh-bounded property. In the present paper the authors extend this result to the class of tree adjunct languages (a proper extension of the class of context-free languages). Tree adjunct grammars and languages were introduced by \textit{A. K. Joshi, L. S. Levy} and \textit{M. Takahashi} [J. Comput. Syst. Sci. 10, 136-163 (1975; Zbl 0326.68053)] in order to study certain linguistic questions.
0 references
semi-linearity
0 references
Parikh-boundedness
0 references
tree adjunct languages
0 references
Tree adjunct grammars
0 references