Bag context picture grammars
| Autor: | Sigrid Ewert, Nuru Jingili, Liemiso Mpota, Ian Sanders |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Password
Grammar Computer Networks and Communications Computer science Programming language media_common.quotation_subject Context (language use) Variation (game tree) computer.software_genre Human-Computer Interaction Set (abstract data type) TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Rule-based machine translation Regulated rewriting Rewriting computer Software media_common |
| Zdroj: | Journal of Computer Languages. 51:214-221 |
| ISSN: | 2590-1184 |
| DOI: | 10.1016/j.cola.2019.04.001 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect