Hexagonal Array Grammar System
K. Sujathakumari, Jismy Joseph, K. S. Dersanambika
Journal of Advances in Mathematics and Computer Science · pp. 1–12 · Published 29 Nov 2015
10.9734/BJMCS/2016/22764Abstract
In 1995, J.Dassow, R.Freund, and G.Paun extended the concept of cooperating grammar system in string case to array grammars by introducing cooperating array grammar system in rectangular grids [1]. Motivated by the fact that, hexagonal arrays on triangular grid can be treated as two dimensional representation of three dimensional blocks, we extended the result of [1] to hexagonal pictures by de ning hexagonal array grammar system. Context-free and regular hexagonal array grammars are two special classes of these grammars and we have made studies regarding the power of cooperation in case of hexagonal array grammars. Different types of hexagonal array grammar systems are defined and the generative capacities of these grammar systems are compared according to the number of components and modes of derivation. We observed that the difference in the generative capacity is based on the fundamental difference between regular and context free array grammars.
Cited by 1
Velu Sudha, K. Easwarakumar · Journal of Supercomputing · 2023
Article metrics
Real usage data collected on this platform.
5
Page views
0
PDF downloads
1
Outbound clicks
1
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.