We use random context picture grammers to generate pictures through successive reÿnement. The productions of such a grammar are context free, but their application is regulated by context randomly distributed in the developing picture. Grammars using this relatively weak context often succeed where
✦ LIBER ✦
A variant of random context grammars: Semi-conditional grammars
✍ Scribed by Gheorghe Pǎun
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 881 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A property of random context picture gra
✍
Andries van der Walt; Sigrid Ewert
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 211 KB
Ensuring Consistency of Conditional Grap
✍
Reiko Heckel; Annika Wagner
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 516 KB
On the Hotz group of a context-free gram
✍
Christiane Frougny; Jacques Sakarovitch; Erich Valkema
📂
Article
📅
1982
🏛
Springer-Verlag
🌐
English
⚖ 342 KB
A generalization of the concept of a con
✍
A. A. Letichevskii
📂
Article
📅
1974
🏛
Springer US
🌐
English
⚖ 278 KB
A method for the inference of non-recurs
✍
C. Chirathamjaree; Martin H. Ackroyd
📂
Article
📅
1980
🏛
Elsevier Science
⚖ 438 KB
A practical method is presented for the automatic generation of a non-recursive context-free grammar (cfg) from a set of strings that the cfg is required to be capable of producing. The method is efficient in computing time by comparison with enumerative methods.
Homogeneous grammars with a reduced numb
✍
A. Meduna; D. Kolář
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 70 KB
A homogeneous production has its left-hand side formed by a non-empty string of identical nonterminals. A phrase-structure grammar is homogeneous if each of its productions is homogeneous. The present paper discusses the reduction of homogeneous grammars with respect to the number of non-context-fre