Cooperating basic puzzle grammar systems

Authors:
K. G. Subramanian;R. Saravanan;P. Helen Chandra
Affiliations:
Department of Mathematics, Madras Christian College, Chennai, India;Department of Mathematics, Bharath Institute of Higher Education and Research, Chennai, India;Department of Mathematics, Jayaraj Annapackiam College for Women, Periyakulam, India
Venue:
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Year:
2006

Citing 3
Cited 3

Context-sensitivity of two-dimensional regular array grammars

International Journal of Pattern Recognition and Artificial Intelligence
Picture languages—a survey

Languages of Design
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Array P Systems and t.Communication

Fundamenta Informaticae - Machines, Computations and Universality, Part I
Array P Systems and t.Communication

Fundamenta Informaticae - Machines, Computations and Universality, Part I
On the power of permitting features in cooperating context-free array grammar systems

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nivat et al [3] introduced Context-free Puzzle grammars for generating connected picture arrays in the two-dimensional plane. Basic Puzzle grammars [6] constitute a subclass of these grammars. In this note we consider the Cooperating Array Grammar Systems introduced by Dassow et al [2] with Basic Puzzle grammar rules in the components instead of array grammar rules and examine the picture generating power of the resulting system, called, Cooperating Basic Puzzle Grammar System, in the maximal mode.