Cooperating basic puzzle grammar systems

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Subramanian, K. G., Saravanan, R., & Chandra, P. H. (2006). Cooperating basic puzzle grammar systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4040 LNCS, pp. 354–360). Springer Verlag. https://doi.org/10.1007/11774938_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free