Adding global forbidding context to context-free grammars (Q1082822): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(85)90096-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035144987 / rank | |||
Normal rank | |||
Revision as of 22:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Adding global forbidding context to context-free grammars |
scientific article |
Statements
Adding global forbidding context to context-free grammars (English)
0 references
1985
0 references
A 1S grammar generalizes a context-free grammar in the following way: a production \(A\to \alpha\) can be applied to a string uAv (to rewrite the designated occurrence of A) provided that all letters from u belong to a fixed alphabet X and all letters from v belong to a fixed alphabet Z (the alphabets X and Z are independent of the production). It is proved that a language is generated by a 1S grammar if and only if it is context-free: this solves an open problem from the theory of selective substitution grammars [\textit{H. C. M. Kleijn} and \textit{G. Rozenberg}, Inf. Control 48, 221-260 (1981; Zbl 0469.68080); corrigendum ibid. 52, 364 (1982; Zbl 0506.68064)].
0 references
one sequential grammars
0 references
context-free languages
0 references
1S grammar
0 references
selective substitution grammars
0 references
