Abstract families of matrices and picture languages

Stromoney, Gift; Siromoney, Rani; Krithivasan, Kamala

doi:10.1016/s0146-664x(72)80019-4

Cited by 140 publications

(68 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We first informally recall here the two-dimensional right-linear grammar (2RLG) [3] (originally introduced in [8]). There are two sets of rules in a 2RLG grammar: horizontal and vertical rules that correspond to Chomsky regular grammars.…”

Section: Fig 1 Chess Board Patternsmentioning

confidence: 99%

A Picture Array Generating Model Based on Flat Splicing Operation

Subramanian

Nagar

Pan

2015

Communications in Computer and Information Science

View full text Add to dashboard Cite

Abstract. The bio-inspired operations of linear and circular splicing respectively on linear and circular strings of symbols have been extensively investigated by many researchers for their theoretical properties. Recently, another kind of splicing of two words, referred to as flat splicing on strings, has been considered. We here extend this operation to flat splicing on picture arrays, thus defining a new model of picture generation, which we call as array flat splicing system (AF S) and obtain some results on the generative power of AF S in comparison with certain well-known picture array defining models.

show abstract

Section: Fig 1 Chess Board Patternsmentioning

confidence: 99%

A Picture Array Generating Model Based on Flat Splicing Operation

Subramanian

Nagar

Pan

2015

Communications in Computer and Information Science

View full text Add to dashboard Cite

show abstract

“…The early model of CF Matrix grammars [51] is a very limited kind of CF Kolam grammars. The following definition is taken and adapted from [48].…”

Section: Context-free Matrix Grammarsmentioning

confidence: 99%

Picture Languages: From Wang Tiles to 2D Grammars

Cherubini

Pradella

2009

Algebraic Informatics

View full text Add to dashboard Cite

show abstract

“…A number of rectangular picture generating and recognizing mechanisms such as grammars and automata have been proposed in the literature [10-13, 16, 17, 19]. Motivated by certain floor designs called "Kolam" patterns, Siromoney et al [15] introduced Siromoney Matrix Grammars (SMG), a simple and elegant grammar model for generating rectangular arrays. This is one of the earliest picture models and has been widely investigated for its theoretical properties and applications.…”

Section: Introductionmentioning

confidence: 99%

Two-dimensional jumping finite automata

Thomas¹,

Immanuel²

2017

Math. Appl.

View full text Add to dashboard Cite

Abstract. In this paper, we extend a newly introduced concept called the jumping finite automata for accepting string languages to two-dimensional jumping finite automata for accepting two-dimensional languages. We discuss some of the basic properties of these automata and compare the family of languages accepted by these automata with the family of Siromoney matrix languages and also recognizable picture languages (REC). We also discuss some of the closure properties of these automata along with some of their decidability properties.

show abstract

Abstract families of matrices and picture languages

Cited by 140 publications

References 6 publications

A Picture Array Generating Model Based on Flat Splicing Operation

A Picture Array Generating Model Based on Flat Splicing Operation

Picture Languages: From Wang Tiles to 2D Grammars

Two-dimensional jumping finite automata

Contact Info

Product

Resources

About