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 条

[1] ON PERMUTATIVE GRAMMARS GENERATING CONTEXT-FREE LANGUAGES
MAKINEN, E
BIT, 1985, 25 (04): : 604 - 610
[2] Hexagonal Prusa Grammar Model for Context-Free Hexagonal Picture Languages
Kamaraj, T.
Thomas, D. G.
COMPUTATIONAL INTELLIGENCE, CYBER SECURITY AND COMPUTATIONAL MODELS, 2014, 246 : 305 - 311
[3] NON-CONTEXT-FREE GRAMMARS GENERATING CONTEXT-FREE LANGUAGES
BAKER, BS
INFORMATION AND CONTROL, 1974, 24 (03): : 231 - 246
[4] Generalized context-free grammars and multiple context-free grammars
Kasami, Tadao
Seki, Hiroyuki
Fujii, Mamoru
Systems and Computers in Japan, 1989, 20 (07): : 43 - 52
[5] A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages
Krivka, Zbynek
Martin-Vide, Carlos
Meduna, Alexander
Subramanian, K. G.
COMBINATORIAL IMAGE ANALYSIS, IWCIA 2014, 2014, 8466 : 123 - 133
[6] Generating Context-Free Grammars using Classical Planning
Segovia-Aguas, Javier
Jimenez, Sergio
Jonsson, Anders
PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 4391 - 4397
[7] Tree generating context-free grammars and regular tree grammars are equivalent
Koszo, David
ANNALES MATHEMATICAE ET INFORMATICAE, 2022, 56 : 58 - 70
[8] PHRASE STRUCTURE GRAMMARS GENERATING CONTEXT-FREE LANGUAGES
CANNON, RL
INFORMATION AND CONTROL, 1975, 29 (03): : 252 - 267
[9] THE STRING GENERATING POWER OF CONTEXT-FREE HYPERGRAPH GRAMMARS
ENGELFRIET, J
HEYKER, L
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1991, 43 (02) : 328 - 360
[10] Generating test data with enhanced context-free grammars
Maurer, Peter M., 1600, (07):

← 1 2 3 4 5 →