✦ LIBER ✦

A property of random context picture grammars

✍ Scribed by Andries van der Walt; Sigrid Ewert

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 211 KB
Volume: 301
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00588-1

No coin nor oath required. For personal study only.

✦ Synopsis

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 context-free grammars fail, e.g., in generating the typical iteration sequence of the SierpiÃ nski carpet. On the other hand, it proved possible to develop iteration theorems for three subclasses of these grammars; ÿnding necessary conditions is problematic in the case of most models of context-free picture grammars with context-sensing ability, since they consider a variable and its context as a connected unit.

We present a property of all picture sets generated with random context picture grammers, and then construct a picture set that does not belong to this class.

📜 SIMILAR VOLUMES

A variant of random context grammars: Se

A variant of random context grammars: Semi-conditional grammars

✍ Gheorghe Pǎun 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 881 KB

A property of modified factored grammars

✍ T. Komor 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 412 KB

A generalization of the concept of a con

A generalization of the concept of a context-free grammar

✍ A. A. Letichevskii 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 278 KB

On the Hotz group of a context-free gram

On the Hotz group of a context-free grammar

✍ Christiane Frougny; Jacques Sakarovitch; Erich Valkema 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 342 KB

A method for the inference of non-recurs

A method for the inference of non-recursive context-free grammars

✍ 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

Homogeneous grammars with a reduced number of non-context-free productions

✍ 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