Semi-linearity, Parikh-boundedness and tree adjunct languages (Q799121): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Matti Linna / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Matti Linna / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(83)90053-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008404821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chains of full AFL's / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree adjunct grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:02, 14 June 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
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers