N. Gnanamalar David

Bio: N. Gnanamalar David is an academic researcher from Madras Christian College. The author has contributed to research in topics: Picture language & Context-free grammar. The author has an hindex of 3, co-authored 9 publications receiving 16 citations.

A Note on Graph Splicing Languages

Abstract: In this paper, we examine the relationship between graph splicing languages of Freund (1995) and Hyperedge replacement graph languages. We also extend the notion of self cross-over introduced by Dassow and Mitrana (1998) to graph languages and compare them with graph splicing languages.

Picture Array Generation Using Pure 2D Context-Free Grammar Rules

Abstract: Pure two-dimensional context-free grammar P2DCFG is a simple but effective non-isometric 2D grammar model to generate picture arrays. This 2D grammar uses only one kind of symbol as in a pure string grammar and rewrites in parallel all the symbols in a column or row by a set of context-free type rules. P2DCFG and a variant called li¾?/i¾?uP2DCFG, which was recently introduced motivated by the "leftmost" rewriting mode in string context-free grammars, have been investigated for different properties. In this paper we introduce another variant of P2DCFG that corresponds to "rightmost" rewriting in string context-free grammars. The resulting grammar is called ri¾?/i¾?dP2DCFG and rewrites in parallel all the symbols only in the rightmost column or the lowermost row of a picture array by a set of context-free type rules. Unlike the case of string context-free grammars, the picture language families of P2DCFG and the two variants li¾?/i¾?uP2DCFG and ri¾?/i¾?dP2DCFG are mutually incomparable, although they are not disjoint. We also examine the effect of regulating the rewriting in a ri¾?/i¾?dP2DCFG by suitably adapting two well-known control mechanisms in string grammars, namely, control words and matrix control.

Generating Picture Arrays Based on Grammar Systems with Flat Splicing Operation

Abstract: The operation of splicing on strings was introduced in the study of recombinant behaviour of DNA molecules. A particular class of splicing, known as flat splicing on strings was recently considered and this operation was extended to picture arrays. Making use of this operation on arrays, we propose a grammar system, called flat splicing array grammar system (FSAGS), as a new model of picture generation. The components of a FSAGS generate picture arrays working in parallel using the rules of a two-phase grammar called 2RLG with two different components communicating using the array flat splicing operation. We exhibit the power of FSAGS in generating certain “floor designs”, besides establishing some comparison results bringing out the generative power of FSAGS.

Flat Splicing Array Grammar Systems GeneratingPicture Arrays

Abstract: 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”.

On Prime Distance Labeling of Graphs

Abstract: A graph G is a prime distance graph if its vertices can be labeled with distinct integers in such a way that for any two adjacent vertices, the absolute difference of their labels is a prime number. It is known that cycles and bipartite graphs are prime distance graphs. In this paper we derive certain general results concerning prime distance labeling. We also investigate prime distance labeling of some cycle related graphs in the context of some graph operations, namely, power, fusion, duplication and vertex switching in cycle \(C_n\).

Semigraph Structure on DNA Splicing System

Abstract: Our main result is to correlate the graph splicing scheme of Rudolf Freund with semi graphs introduced by E. Sampathkumar [10]. We get characterization of DNA structure after splicing in terms of semi graph to show some splicing graph properties. In this paper, we introduce semi graph folding for the DNA splicing system and show that any n-cut spliced semi graph (n ? 1) can be folded onto an edge and two semi edges at the maximum of four semi graph folding.

Parallel contextual array P systems

Abstract: Contextual array P systems generate two-dimensional picture arrays by sequential application of contextual array rules on picture arrays. Here we consider a parallel mode of application of the contextual array rules in the regions of such an array P system. We call the resulting array P system as parallel contextual array P system (PCAP) and we study the generative power of these systems. A main advantage is that the number of membranes needed in the constructions of the PCAP for picture array generation is reduced in comparison with the sequential counterpart.

Flat Splicing Array Grammar Systems GeneratingPicture Arrays

Abstract: 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”.