Showing papers by "Kamala Krithivasan published in 2006"
TL;DR: In this article, extended graph splicing systems are defined, and it is shown that when strings are represented as linear graphs, any recursively enumerable set can be generated by an EGS.
4 citations
19 Jun 2006
TL;DR: An efficient algorithm is given to tile a 2D-square grid with only t1,2, t2,1, t 1,1 tiles such that the projection of this tiling is the same as the given projection.
Abstract: We define the projection of a tiling as a matrix P = (pij) where pi1 is number of t1,2 tiles in row i and pi2 is the number of t2,1 tiles in row i. We give an efficient algorithm to tile a 2D-square grid with only t1,2, t2,1, t1,1 tiles such that the projection of this tiling is the same as the given projection.
01 Jan 2006
TL;DR: This paper defines communicating distributed H systems with simple splicing rules of types (1-3), (1,4) and (2-3) and study the generative capacity of these systems.
Abstract: In this paper we define communicating distributed H systems with simple splicing rules of types (1,3), (1,4) and (2,3) and study the generative capacity. keyword: Splicing systems, contextfree languages, simple H systems, test tube systems, communicating distributed H systems
Journal Article•
TL;DR: In this article, the authors define the projection of a tiling as a matrix P = (p ij ) where p i1 is number of t 1,2 tiles in row i and p i2 is the number of T 2,1 tiles on row i.
Abstract: We define the projection of a tiling as a matrix P = (p ij ) where p i1 is number of t 1,2 tiles in row i and p i2 is the number of t 2,1 tiles in row i. We give an efficient algorithm to tile a 2D-square grid with only t 1,2 , t 2,1 , t 1,1 tiles such that the projection of this tiling is the same as the given projection.