• Mathematics
  • Published 2015

Ogden's Lemma for Random Permitting and Forbidding Context Picture Languages and Table-Driven Context-Free Picture Languages

@inproceedings{Ewert2015OgdensLF,
  title={Ogden's Lemma for Random Permitting and Forbidding Context Picture Languages and Table-Driven Context-Free Picture Languages},
  author={Sigrid Ewert},
  year={2015}
}
Random context picture grammars are used to generate pictures through successive refinement. There are three important subclasses of random context picture grammars, namely random permitting context picture grammars, random forbidding context picture grammars and table-driven context-free picture grammars. These grammars generate the random permitting context picture languages, random forbidding context picture languages and table-driven context-free picture languages, respectively. Theorems… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

Ogden's Lemma for ET0L Languages

  • LATA
  • 2012
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Lindenmayer Systems, Fractals, and Plants

  • Lecture Notes in Biomathematics
  • 1989
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Necessary Conditions for Random Context Galleries. Technical report, Department of Computer Science, University of the Witwatersrand, Johannesburg, South Africa

  • Honors Research Report
  • 2013

On the power of permitting features in cooperating context-free array grammar systems

Subramanian
  • Discrete Applied Mathematics,
  • 2013
VIEW 1 EXCERPT

A property of random

van der Walt, Ewert 2003 Andries van der Walt, Sigrid Ewert
  • 2003