Flat Splicing Array Grammar Systems Generating Picture Arrays

While studying the recombinant behaviour of DNA molecules, Head (1987) introduced a new operation, called splicing on words or strings, which are finite sequences of symbols. There has been intensive research using the concept of splicing on strings in the context of DNA computing, establishing important theoretical results on computational universality. A particular class of splicing, known as flat splicing on strings was recently considered and this operation was extended to provide picture array generating two-dimensional models. Making use of the operation of flat splicing on arrays, we propose here a grammar system, called flat splicing regular array grammar system (FSRAGS), as a new model of picture generation. The components of a FSRAGS generate picture arrays working in parallel using the rules of a two-phase grammar called 2RLG and with two different components of the FSRAGS communicating using the array flat splicing operations on columns and rows of the arrays. We establish some comparison results bringing out the generative power of FSRAGS and also exhibit the power of FSRAGS in generating certain “floor designs”

A Bio-inspired Model of Picture Array Generating P System with Restricted Insertion Rules

In the bio-inspired area of membrane computing, a novel computing model with a generic name of P system was introduced around the year 2000. Among its several variants, string or array language generating P systems involving rewriting rules have been considered. A new picture array model of array generating $P$ system with a restricted type of picture insertion rules and picture array objects in its regions, is introduced here. The generative power of such a system is investigated by comparing with the generative power of certain related picture array grammar models introduced and studied in two-dimensional picture language theory. It is shown that this new model of array P system can generate picture array languages which cannot be generated by many other array grammar models. The theoretical model developed is for handling the application problem of generation of patterns encoded as picture arrays over a finite set of symbols. As an application, certain floor-design patterns are generated using such an array $P$ system

A Picture Array Generating Model Based on Flat Splicing Operation

The bio-inspired operations of linear and circular splicing respectively on linear and circular strings of symbols have been extensively investigated by many researchers for their theoretical properties. Recently, another kind of splicing of two words, referred to as flat splicing on strings, has been considered. We here extend this operation to flat splicing on picture arrays, thus defining a new model of picture generation, which we call as array flat splicing system (AF S) and obtain some results on the generative power of AF S in comparison with certain well-known picture array defining model

Genomics and proteomics: a signal processor's tour

The theory and methods of signal processing are becoming increasingly important in molecular biology. Digital filtering techniques, transform domain methods, and Markov models have played important roles in gene identification, biological sequence analysis, and alignment. This paper contains a brief review of molecular biology, followed by a review of the applications of signal processing theory. This includes the problem of gene finding using digital filtering, and the use of transform domain methods in the study of protein binding spots. The relatively new topic of noncoding genes, and the associated problem of identifying ncRNA buried in DNA sequences are also described. This includes a discussion of hidden Markov models and context free grammars. Several new directions in genomic signal processing are briefly outlined in the end

GNU epsilon - an extensible programming language

Reductionism is a viable strategy for designing and implementing practical programming languages, leading to solutions which are easier to extend, experiment with and formally analyze. We formally specify and implement an extensible programming language, based on a minimalistic first-order imperative core language plus strong abstraction mechanisms, reflection and self-modification features. The language can be extended to very high levels: by using Lisp-style macros and code-to-code transforms which automatically rewrite high-level expressions into core forms, we define closures and first-class continuations on top of the core. Non-self-modifying programs can be analyzed and formally reasoned upon, thanks to the language simple semantics. We formally develop a static analysis and prove a soundness property with respect to the dynamic semantics. We develop a parallel garbage collector suitable to multi-core machines to permit efficient execution of parallel programs.Comment: 172 pages, PhD thesi

NASA Tech Briefs, November 1990

Topics: New Product Ideas; NASA TU Services; Electronic Components and Circuits; Electronic Systems; Physical Sciences; Materials; Computer Programs; Mechanics; Machinery; Fabrication Technology; Mathematics and Information Sciences