Ogden's lemma for random permitting and forbidding context picture languages and table-driven context-free picture languages
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, in fulfilment of requirements for the degree of Master of Science. Johannesburg, February 16, 2015. === Random context picture grammars are used to generate pictures through successive refinement. The...
Main Author: | Idahosa, Joy O |
---|---|
Format: | Others |
Language: | en |
Published: |
2015
|
Subjects: | |
Online Access: | http://hdl.handle.net/10539/17645 |
Similar Items
-
Ogden's lemma for random permitting-and forbidding-context and ET0L languages
by: Rabkin, Max Stacey
Published: (2013) -
Formalization of the pumping lemma for context-free languages
by: Marcus V M Ramos, et al.
Published: (2016-12-01) -
Forbidding and enforcing of formal languages, graphs, and partially ordered sets
by: Genova, Daniela
Published: (2007) -
Unified picture of electromagnetic and gravitational forces in two-spinor language
by: J. Buitrago
Published: (2020-03-01) -
Expressing Context-Free Tree Languages by Regular Tree Grammars
by: Teichmann, Markus
Published: (2017)