Rewriting P Systems Generating Iso-picture Languages

Annadurai, S.; Thomas, D. G.; Dare, V. R.; Kalyani, T.

doi:10.1007/978-3-540-78275-9_31

Cited by 5 publications

(5 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence it is clear that Proof. It is clear that IARP 1 (CF IAG) = L(CF IAG), see [1]. Hence it is true that L(CF IAG) ⊆ IARP 2 (CF IAG).…”

Section: This Cfiag Generates a Language L ∈ L(cf Iag)mentioning

confidence: 90%

“…Wang tiling systems, contextfree iso-array grammars and context-free puzzle iso-array grammars are used for picture generation [3,4]. Iso-array rewriting P systems for picture languages are studied in [1]. This iso-array rewriting P system can be used as a basic framework for the picture extraction in contour image retrieval system in which the picture position and orientation can be analyzed.…”

Section: Introductionmentioning

confidence: 99%

“…A theoretical model for picture generation using context-free iso-array grammar rules and puzzle iso-array grammar rules are introduced by Kalyani et al (2004Kalyani et al ( , 2006. Also iso-array rewriting P systems for iso-picture languages have been studied by Annadurai et al (2008). In this paper we consider the context-free iso-array rules and context-free puzzle iso-array rules in iso-array rewriting P systems and examine the generative powers of these P systems.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Iso-array rewriting P systems with context-free iso-array rules

Kalyani¹,

Thomas²,

Nagar³

et al. 2014

Math. Appl.

Self Cite

View full text Add to dashboard Cite

Abstract. A new computing model called P system is a highly distributed and parallel theoretical model, which is proposed in the area of membrane computing. Ceterchi et al. initially proposed array rewriting P systems by extending the notion of string rewriting P systems to arrays (2003). A theoretical model for picture generation using context-free iso-array grammar rules and puzzle iso-array grammar rules are introduced by Kalyani et al. (2004Kalyani et al. ( , 2006. Also iso-array rewriting P systems for iso-picture languages have been studied by Annadurai et al. (2008). In this paper we consider the context-free iso-array rules and context-free puzzle iso-array rules in iso-array rewriting P systems and examine the generative powers of these P systems.

show abstract

“…Hence it is clear that Proof. It is clear that IARP 1 (CF IAG) = L(CF IAG), see [1]. Hence it is true that L(CF IAG) ⊆ IARP 2 (CF IAG).…”

Section: This Cfiag Generates a Language L ∈ L(cf Iag)mentioning

confidence: 90%

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Iso-array rewriting P systems with context-free iso-array rules

Kalyani¹,

Thomas²,

Nagar³

et al. 2014

Math. Appl.

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [2], [3] P systems with context-free iso array grammar rules are studied to generate iso-pictures and the power of context-free iso-array rewriting P systems are examined. Also the iso array rewriting P systems with iso array grammars is considered in [1] and three variants of rewriting P system is studied in [5].…”

Section: Introductionmentioning

confidence: 99%

Contextual iso-triangular array P system and iso-triangular picture languages

Bhuvaneswari

Kalyani

Thomas³

2014

Asian Conference on Membrane Computing ACMC 2014

Self Cite

View full text Add to dashboard Cite

show abstract

“…Ceterchi et al [4], [5], [9] introduced array systems and extended the string rewriting systems using array context free type rules. In [1], [3] systems with context-free iso array grammar rules studied to generate iso pictures and the power of contextfree iso-array rewriting systems are examined. In [12] the contextual array grammars and array system is introduced and in this work the proper infinite hierarchy in membranes with respect to a class of two dimensional languages are described.…”

Section: Introductionmentioning

confidence: 99%

Contextual iso-triangular array P system and hexagonal picture languages

Bhuvaneswari¹,

Kalyani

Thomas³

2014

2014 IEEE International Conference on Computational Intelligence and Computing Research

Self Cite

View full text Add to dashboard Cite

In this paper contextual string grammar model is extended to a two dimensional array grammar model, called contextual iso-triangular array grammar. Membrane computing is a computational model and in which system is its device. It is a cell like structure model. We continue the study of linking these two areas by introducing contextual iso triangular array system and we investigate its power in generating the hexagonal picture languages. The main interesting study is that makes use of contextual iso triangular array erasing rules of contextual iso triangular array system, the star picture is generated.

show abstract

Rewriting P Systems Generating Iso-picture Languages

Cited by 5 publications

References 8 publications

Iso-array rewriting P systems with context-free iso-array rules

Iso-array rewriting P systems with context-free iso-array rules

Contextual iso-triangular array P system and iso-triangular picture languages

Contextual iso-triangular array P system and hexagonal picture languages

Contact Info

Product

Resources

About