Alphabetic Flat Splicing Pure Context-free Grammar Systems

Abstract

Abstract. In the context of DNA computing, an operation on words, called splicing, was introduced by Head (1987), in his study on recombinant behavior of DNA molecules. Recently, a special kind of splicing, called flat splicing on strings, was considered and several properties were derived. On the other hand, in the study of modelling of distributed complex systems based on language theory, grammar systems were proposed. Here we introduce a grammar system, called alphabetic flat splicing pure context-free grammar system ‫,)ܵܩܨܥܲܵܨܣ(‬ as a new model of language generation, based on the operation of alphabetic flat splicing on words and pure context-free rules. We derive certain comparison results that bring out the generative power of ‫ܵܩܨܥܲܵܨܣ‬ and as an application construct a ‫ܵܩܨܥܲܵܨܣ‬ generating "floor-design" pictures.

Picture Array Generation Based on Membrane Systems and 2D Context-Free Grammars

“…Comparisons with other kinds of 2D picture generating models such as the class of recognizable picture languages [2] remain to be explored. Possible application to generation of picture patterns can also be examined as done in [8].…”

Derivation languages and descriptional complexity measures of restricted flat splicing systems

“…Also different variants of flat splicing systems and their computational power for linear as well as for circular words such as alphabetic flat splicing systems, pure alphabetic flat splicing systems, concatenation systems have been discussed in [1]. The language generating power of the alphabetic flat splicing P systems, its variants and matrix variant of flat splicing systems have been discussed in [13], [18] and [2] respectively. Some new model of picture generation using the flat splicing rules in arrays has been introduced in [19].…”