Context-free text grammars (Q1323383): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Andrzej Ehrenfeucht / rank | |||
Property / author | |||
Property / author: Paulien ten Pas / rank | |||
Property / author | |||
Property / author: Grzegorz Rozenberg / rank | |||
Property / author | |||
Property / author: Andrzej Ehrenfeucht / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Paulien ten Pas / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Grzegorz Rozenberg / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Theory of 2-structures. I: Clans, basic subclasses, and morphisms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Theory of 2-structures. II: Representation through labeled tree families / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Angular 2-structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: T-structures, T-functions, and texts / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial properties of texts / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5678435 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01192159 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2031277438 / rank | |||
Normal rank |
Latest revision as of 11:35, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Context-free text grammars |
scientific article |
Statements
Context-free text grammars (English)
0 references
2 June 1994
0 references
A text is a triple \(\tau=(\lambda,\rho_ 1,\rho_ 2)\) such that \(\lambda\) is a labeling function, and \(\rho_ 1\) and \(\rho_ 2\) are linear orders on the domain of \(\lambda\); hence \(\tau\) may be seen as a word \((\lambda,\rho_ 1)\) together with an additional linear order \(\rho_ 2\) on the domain of \(\lambda\). The order \(\rho_ 2\) is used to give to the word \((\lambda,\rho_ 1)\) its individual hierarchical representation (syntactic structure) which may be a tree but it may be also more general than a tree. In this paper we introduce context-free grammars for texts and investigate their basic properties. Since each text has its own individual structure, the role of such a grammar should be that of a definition of a pattern common to all individual texts. This leads to the notion of a shapley context-free text grammar also investigated in this paper.
0 references
context-free grammars
0 references
texts
0 references