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

TL;DR

This paper introduces permitting symbols into cooperating distributed context-free hexagonal array grammar systems, enhancing their generative power and reducing the number of components needed for generating picture arrays.

Contribution

It extends existing grammar systems by integrating permitting symbols, simplifying pattern matching, and improving efficiency in generating array-based patterns.

Findings

Permitting symbols reduce component count in grammar systems.

Enhanced generative power with permitting symbols.

Simpler pattern matching in array generation.

Abstract

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.