Parallel/sequential rectangular arrays with tables

Siromoney, Rani; Subramanian, K. G.; Rangarajan, K.

doi:10.1080/00207167708803133

Cited by 39 publications

(19 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The equalities in statements (1) and (3) are clear from definitions and the proper inclusions are known [12]. Statement (2) is proved in [4].…”

Section: There Is No Priority Between Steps (I) and (Ii)mentioning

confidence: 93%

“…The image splicing grammar system (ISGS)introduced in [4] in which the component grammars are 2d Matrix grammars [12]is a special case of SAGS.…”

Section: There Is No Priority Between Steps (I) and (Ii)mentioning

confidence: 99%

“…Here, motivated by the study of Dassow and Mitrana [3], we consider Grammar Systems that describe Pictures of rectangular arrays. The components of these Grammar systems consist of two-dimensional (2d) tabled matrix grammars [12] and domino splicing rules [9] with the grammars working in parallel and splicing rules acting on arrays of two components yielding rectangular arrays of symbols. The resulting systems are called Splicing Array Grammar Systems (SAGS).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Splicing Array Grammar Systems

Subramanian¹,

Mary

Dersanambika

2005

Theoretical Aspects of Computing – ICTAC 2005

Self Cite

View full text Add to dashboard Cite

Abstract. Splicing Array Grammar Systems (SAGS) generating pictures of rectangular arrays of symbols are introduced. The components consist of two-dimensional tabled matrix Grammars working in parallel and arrays generated in two different components of the SAGS are allowed to be "cut" and "pasted" according to array splicing domino rules. This model is motivated by the study of Dassow and Mitrana (1996) on string splicing grammar systems. Certain properties of SAGS are obtained.

show abstract

“…The equalities in statements (1) and (3) are clear from definitions and the proper inclusions are known [12]. Statement (2) is proved in [4].…”

Section: There Is No Priority Between Steps (I) and (Ii)mentioning

confidence: 93%

“…The image splicing grammar system (ISGS)introduced in [4] in which the component grammars are 2d Matrix grammars [12]is a special case of SAGS.…”

Section: There Is No Priority Between Steps (I) and (Ii)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Splicing Array Grammar Systems

Subramanian¹,

Mary

Dersanambika

2005

Theoretical Aspects of Computing – ICTAC 2005

Self Cite

View full text Add to dashboard Cite

show abstract

“…Once two rules (A # → aC, {B }) and (B # → aD, {C}) of component P 1 are used, the generations of these two arms end with terminal a and then starts the generations of upper and lower arms of the hexagon using rules (6) to (11). Then the right application of rule (12) to (17) then (18), (19), .…”

Section: Issn: 2231-5373mentioning

confidence: 99%

Cooperating distributed context-free hexagonal array grammar systems with permitting contexts

K¹,

K.S²

2014

IJMTT

View full text Add to dashboard Cite

In this paper we associate permitting symbols with rules of Grammars in the components of cooperating distributed context-free hexagonal array grammar systems as a control mechanism and investigating the generative power of the resulting systems in the terminal mode. This feature of associating permitting symbols with rules when extended to patterns in the form of connected arrays also requires checking of symbols, but this is simpler than usual pattern matching. The benefit of allowing permitting symbols is that it enables us to reduce the number of components required in a cooperating distributed hexagonal array grammar system for generating a set of picture arrays.

show abstract

“…This is one of the earliest picture models and has been widely investigated for its theoretical properties and applications. Several variations of Siromoney matrix grammars have been made in the literature [18,20]. A particular case is the Siromoney Array Grammars (AG) where array rewriting rules are deployed in the derivation of pictures.…”

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

Parallel/sequential rectangular arrays with tables

Cited by 39 publications

References 7 publications

Splicing Array Grammar Systems

Splicing Array Grammar Systems

Cooperating distributed context-free hexagonal array grammar systems with permitting contexts

Two-dimensional jumping finite automata

Contact Info

Product

Resources

About