Puzzle Grammars and Context-Free Array Grammars

Nivat, Maurice; Saoudi, A.; Subramanian, K. G.; Siromoney, Rani; Dare, V. R.

doi:10.1142/s0218001491000399

Cited by 28 publications

(8 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Motivated by the problem of tiling, puzzle grammars that fall under the category of syntactic techniques have been proposed by Nivat et al [9]. Syntactic methods have become one of the main areas of investigation in theoretical studies on digital pictures and image analysis.…”

Section: Introductionmentioning

confidence: 99%

Triangular Tile Pasting $P$ System and Array Generating Petri Nets

Bhuvaneswari¹,

Kalyani²,

Lalitha³

2016

Int. J. of Pure and Appl. Math.

View full text Add to dashboard Cite

In the area of membrane computing, a new computability model, called P system is a highly distributed and parallel theoretical computing model. Generating two dimensional picture languages is one of the applications of P systems. Ceterachi et al. began a study on connecting the two areas, membrane computing and array grammars. Triangular tile pasting system and the Triangular Tile pasting P system models have been introduced for pattern generation. This paper introduce the k-order TTPS and ETTPS. Also this paper has extended the theory of Triangular tile pasting P system to generate two dimensional picture languages.A comparative study between triangular tile pasting system and Triangular tile pasting P system is made. Comparison is also made with the array generating Petri nets.

show abstract

Section: Introductionmentioning

confidence: 99%

Triangular Tile Pasting $P$ System and Array Generating Petri Nets

Bhuvaneswari¹,

Kalyani²,

Lalitha³

2016

Int. J. of Pure and Appl. Math.

View full text Add to dashboard Cite

show abstract

“…On the other hand, models defining pictures that are connected arrays but not necessarily rectangular have been proposed as early as in the 70's in [8] and a hierarchy of these grammars was considered in [15,13]. A related class of grammars for picture generation, again not necessarily rectangular, has been proposed in [7]. A new model of recognizable picture languages, extending to two dimensions the characterization of the one-dimensional recognizable languages in terms of alphabetic morphisms of local languages, has been introduced in [3].…”

Section: Introductionmentioning

confidence: 99%

Accepting Networks of Evolutionary Picture Processors

Bottoni

Labella

Mitrana

2014

Fundamenta Informaticae

View full text Add to dashboard Cite

We extend the study of networks of evolutionary processors accepting words to a similar model, processing rectangular pictures. To this aim, we introduce accepting networks of evolutionary picture processors and investigate their computational power. We show that these networks can accept the complement of any local picture language as well as picture languages that are not recognizable. Some open problems regarding decidability issues and closure properties are finally discussed.

show abstract

“…Ceterchi et al began a study on linking the two areas of membrane computing and picture grammars by relating P systems and array rewriting grammars generating picture languages and proposing array rewriting P systems [2]. Subsequently, a number of P systems with array objects and different kinds of rewriting were introduced in [5,10,11]. The two dimensional grammar models called puzzle grammars for generating connected arrays of unit cells are discussed in [12,13].…”

Section: Introductionmentioning

confidence: 99%

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

Kalyani¹,

Thomas²,

Nagar³

et al. 2014

Math. Appl.

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

Puzzle Grammars and Context-Free Array Grammars

Cited by 28 publications

References 0 publications

Triangular Tile Pasting $P$ System and Array Generating Petri Nets

Triangular Tile Pasting $P$ System and Array Generating Petri Nets

Accepting Networks of Evolutionary Picture Processors

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

Contact Info

Product

Resources

About