Pure Hexagonal Context-Free Grammars Generating Hexagonal Patterns

被引：0

作者：

Patnaik, Pawan Kumar ^{[1
]}

Metta, Venkata Padmavati ^{[1
]}

Singh, Jyoti ^{[2
]}

Thomas, D. G. ^{[3
]}

机构：

[1] Bhilai Inst Technol, Dept Comp Sci & Engn, Durg, India

[2] Chhattisgarh Profess Examinat Board, Raipur, Madhya Pradesh, India

[3] SIMATS, Saveetha Sch Engn, Dept Math, Chennai, Tamil Nadu, India

来源：

COMPUTATIONAL MODELING OF OBJECTS PRESENTED IN IMAGES: FUNDAMENTALS, METHODS, AND APPLICATIONS, COMPIMAGE 2018 | 2019年 / 10986卷

关键词：

Hexagonal arrays; Array grammars; Pure grammars; Two-dimensional CFGs;

D O I：

10.1007/978-3-030-20805-9_5

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A new syntactic model, called pure hexagonal context free grammar is introduced based on the notion of pure two-dimensional context-free grammar. These grammars generate hexagonal picture arrays on triangular grids. We also examine certain closure properties of pure hexagonal context free languages.

引用

页码：42 / 55

页数：14

共 50 条

[31] ON CONTEXT-FREE PROGRAMMED GRAMMARS
SEBESTA, RW
COMPUTER LANGUAGES, 1989, 14 (02): : 99 - 108
[32] MINIMIZATION OF CONTEXT-FREE GRAMMARS
Ryazanov, Yu D.
Nazina, S., V
PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2019, (45): : 90 - 96
[33] CONTEXT-FREE TEXT GRAMMARS
EHRENFEUCHT, A
TENPAS, P
ROZENBERG, G
ACTA INFORMATICA, 1994, 31 (02) : 161 - 206
[34] Binary Context-Free Grammars
Turaev, Sherzod
Abdulghafor, Rawad
Alwan, Ali Amer
Abd Almisreb, Ali
Gulzar, Yonis
SYMMETRY-BASEL, 2020, 12 (08):
[35] Evolving context-free grammars
Cyre, W
PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2002, : 643 - 646
[36] ON MULTIPLE CONTEXT-FREE GRAMMARS
SEKI, H
MATSUMURA, T
FUJII, M
KASAMI, T
THEORETICAL COMPUTER SCIENCE, 1991, 88 (02) : 191 - 229
[37] Pullback Grammars Are Context-Free
Bauderon, Michel
Chen, Rui
Ly, Olivier
GRAPH TRANSFORMATIONS, ICGT 2008, 2008, 5214 : 366 - +
[38] Cooperation in context-free grammars
Dassow, J
Mitrana, V
THEORETICAL COMPUTER SCIENCE, 1997, 180 (1-2) : 353 - 361
[39] INDEXED GRAMMARS - AN EXTENSION OF CONTEXT-FREE GRAMMARS
AHO, AV
JOURNAL OF THE ACM, 1968, 15 (04) : 647 - &
[40] Generating all permutations by context-free grammars in Chomsky normal form
Asveld, PRJ
THEORETICAL COMPUTER SCIENCE, 2006, 354 (01) : 118 - 130

← 1 2 3 4 5 →