Local and Recognizable Iso Picture Languages

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

doi:10.1007/978-3-540-30499-9_113

Cited by 14 publications

(6 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section we recall the notions of iso-triangular tiling systems, iso-arrays, iso picture languages and context-free iso-array, context-free puzzle iso-array grammars [3,4].…”

Section: Preliminariesmentioning

confidence: 99%

“…Iso-arrays can be used in tiling system, pattern generation and kolam pattern. 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].…”

Section: Introductionmentioning

confidence: 99%

“…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).…”

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

“…In this section we recall the notions of iso-triangular tiling systems, iso-arrays, iso picture languages and context-free iso-array, context-free puzzle iso-array grammars [3,4].…”

Section: Preliminariesmentioning

confidence: 99%

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

“…We introduced the notion of iso-arrays, iso-pictures, and isopicture languages in (Kalyani et al, 2004). A motivation for this study is that one can generate some interesting picture languages which cannot be generated by earlier models available in the literature.…”

Section: Introductionmentioning

confidence: 99%

“…Motivated by these studies, we have introduced a new notion of recognizability for a class of picture languages called iso-picture languages through iso-triangular tiling systems (ITS) and studied the properties of these languages [Kalyani et al, 2004]. In [Kalyani et al, 2005], we introduced iso-triangular domino systems (IDS) to recognize iso-picture languages, and proved the equivalence of ITS and IDS.…”

mentioning

confidence: 99%

Recognizability of iso‐picture languages by Wang systems

Kalyani

Dare²,

Thomas³

2009

Int J Imaging Syst Tech

Self Cite

View full text Add to dashboard Cite

In the context of a syntactic approach to pattern recognition, there have been several studies in the last few decades on theoretical models for generating or recognizing two-dimensional objects, pictures, and picture languages. Motivated by these studies, we have introduced a new notion of recognizability for a class of picture languages called iso-picture languages through iso-triangular tiling systems (ITS) and studied the properties of these languages [Kalyani et al., 2004]. In [Kalyani et al., 2005], we introduced iso-triangular domino systems (IDS) to recognize iso-picture languages, and proved the equivalence of ITS and IDS. In [Kalyani et al., 2006], we have constructed a two-dimensional online tessellation automaton (IPOTA) to recognize an iso-picture language and presented an algorithm to learn recognizable iso-picture languages from positive data and restricted subset queries. In this article, we introduce isotriangular Wang systems (IWS) to recognize iso-picture languages. We prove that the family of iso-picture languages recognized by isotriangular Wang systems L(IWS) coincides with the family of iso-picture languages recognized by iso-triangular tiling sytems L(ITS). We show that L(ITS) 5 L(IDS) as a corollary and obtain that the families of iso-picture languages L(ITS), L(IDS), L(IWS), and L(IPOTA) all coincide.

show abstract