Abstract
Abstract Random context picture grammars (RCPGs) have become established as a method of syntactic picture generation. They are context-free grammars with regulated rewriting, where the application of a rule in the grammar is regulated by two sets of variables, the so-called permitting and forbidding context sets. In this paper, we introduce bag context picture grammars (BCPGs). They are also context-free grammars, but the application of a rule is regulated by a k-tuple of integers, the so-called bag, which changes during a derivation. We prove that any RCPG can be written as a BCPG and illustrate the rewriting process with several examples. We then consider one set of pictures and discuss why it is easier to write a BCPG that generates a variation on the set, and modify that BCPG again, should we wish to, than to do the same to the RCPG that generates the original picture set. This allows for application in visual password systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
