Hexagonal Prusa Grammar Model for Context-Free Hexagonal Picture Languages

被引:2
|
作者
Kamaraj, T. [1 ]
Thomas, D. G. [2 ]
机构
[1] Sathyabama Univ, Dept Math, Madras 600119, Tamil Nadu, India
[2] Madras Christian Coll, Dept Math, Madras 600059, Tamil Nadu, India
来源
COMPUTATIONAL INTELLIGENCE, CYBER SECURITY AND COMPUTATIONAL MODELS | 2014年 / 246卷
关键词
Hexagonal array languages; Hexagonal tiling system; Regional hexagonal tile rewriting grammars; Prusa grammars;
D O I
10.1007/978-81-322-1680-3_33
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Prusa Grammar is a recently introduced rectangular picture languages generating model which exploits the parallel application of two-dimensional context-free rules. We introduce the hexagonal version of Prusa grammar and generate images. We compare this model with other hexagonal array generating devices for the description of its generative power.
引用
收藏
页码:305 / 311
页数:7
相关论文
共 50 条
  • [1] Generative Power of Hexagonal Prusa Grammar Model Revisited
    Kamaraj, T.
    SOFT COMPUTING FOR PROBLEM SOLVING, 2019, 817 : 475 - 484
  • [2] Pure Hexagonal Context-Free Grammars Generating Hexagonal Patterns
    Patnaik, Pawan Kumar
    Metta, Venkata Padmavati
    Singh, Jyoti
    Thomas, D. G.
    COMPUTATIONAL MODELING OF OBJECTS PRESENTED IN IMAGES: FUNDAMENTALS, METHODS, AND APPLICATIONS, COMPIMAGE 2018, 2019, 10986 : 42 - 55
  • [3] Mechanisation of PDA and Grammar Equivalence for Context-Free Languages
    Barthwal, Aditi
    Norrish, Michael
    LOGIC, LANGUAGE, INFORMATION AND COMPUTATION, 2010, 6188 : 125 - 135
  • [4] Hexagonal Picture Languages Generated By Assembling Hexagonal Tiles
    Anitha, P.
    INTERNATIONAL JOURNAL OF NEXT-GENERATION COMPUTING, 2020, 11 (03): : 235 - 249
  • [5] Undecidability of the emptiness problem for context-free picture languages
    Prusa, Daniel
    Reinhardt, Klaus
    THEORETICAL COMPUTER SCIENCE, 2017, 679 : 118 - 125
  • [6] Regular expressions and context-free grammars for picture languages
    Matz, O
    STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 283 - 294
  • [7] QUESTIONS OF DECIDABILITY FOR CONTEXT-FREE CHAIN CODE PICTURE LANGUAGES
    HINZ, F
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 381 : 2 - 11
  • [8] Local and recognizable hexagonal picture languages
    Dersanambika, KS
    Krithivasan, K
    Martin-Vide, C
    Subramanian, KG
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2005, 19 (07) : 853 - 871
  • [9] THE MEMBERSHIP PROBLEM FOR CONTEXT-FREE CHAIN CODE PICTURE LANGUAGES
    HINZ, F
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 452 : 329 - 336
  • [10] A Graphical Model for Context-Free Grammar Parsing
    Pingali, Keshav
    Bilardi, Gianfranco
    COMPILER CONSTRUCTION (CC 2015), 2015, 9031 : 3 - 27