scholarly journals H-array system on picture languages with array rewriting rules

2020 ◽  
Author(s):  
D. K. Sheena Christy ◽  
P. John Paul ◽  
D. G. Thomas
Keyword(s):  
Picture Languages ◽  
Rewriting Rules

scholarly journals Generative Aspects of Oxide Pictures by Oxide Tile Rewriting Grammar

2019 ◽  
Vol 8 (3) ◽  
pp. 1537-1543
Keyword(s):  
Two Dimensions ◽  
Two Dimensional ◽  
Silicate Network ◽  
Oxygen Ions ◽  
Tiling System ◽  
Higher Dimensional ◽  
Picture Languages ◽  
Rectangular Grids ◽  
Rewriting Rules ◽  
Special Case

In formal languages, picture language is generalization of string language theory to two dimensions. Pictures which may be regarded as two-dimensional objects occur in studies concerning recognition of patterns, images and various computational fields. Several studies have been done for generating and/or recognizing higher dimensional objects using formal models. Tile rewriting grammar (TRG) is yet another model introduced for generating picture languages. TRG combines isometric rewriting rules with the Giammaresi and Restivo’s Tiling system. This rewriting grammar generates spirals, square and rectangular grids. The power of generating pictures by tile rewriting grammar is more than REC .Sweety et al have generated hexagonal pictures, introducing hexagonal Tile Rewriting Grammar. Kuberalet al have introduced Triangular Tile Rewriting Grammar to generate Triangular Pictures. A special class of objects namely Oxide pictures have been of interest recently. Oxide network is a special case of Silicate network. The silicates are a complicated class of minerals made up of tetrahedral silicates. A basic silicate tetrahedron unit SiO4 is formed with Oxygen ions in the corners and a Silicate ion in the center. In a two dimensional plane a ring of tetrahedrons that are shared by Oxygen nodes forms a silicate sheet.In this paper, Oxide Tile Rewriting Grammar (OXTRG) is proposed for generating Oxide pictures. The motivation for the study is derived from the Oxide network which is obtained by deleting all the silicon nodes of a silicate network. Closure properties of OXTRG are discussed. When compared with schemes such as Oxide Tiling System and Oxide Sgraffito Automaton, OXTRG is found to be more powerful.

scholarly journals Picture languages with array rewriting rules

1973 ◽  
Vol 22 (5) ◽  
pp. 447-470 ◽  
Author(s):  
Gift Siromoney ◽  
Rani Siromoney ◽  
Kamala Krithivasan
Keyword(s):  
Picture Languages ◽  
Rewriting Rules

scholarly journals Chain Code P System using Cycle Grammar

2019 ◽  
Vol 8 (2) ◽  
pp. 327-330
Keyword(s):  
Distributed Computing ◽  
P System ◽  
Chain Code ◽  
Computing Model ◽  
System A ◽  
Frame Work ◽  
Picture Languages ◽  
String Rewriting ◽  
Rewriting Rules

P system is a bio-inspired distributed computing model to generate string languages [4], arrays [7] and tessellation patterns [2]. Chain Code P System is a string rewriting computing model to generate chain code picture languages in the frame work of P system. A variant of chain code P system is introduced in this paper, namely Cycle Rewriting Chain Code P system, where the string rewriting rules uses cycle grammar to construct cycle picture languages. We consider the problem of constructing chain code picture languages with even number of chains, kites, Von Koch quadric 8 segment like curves and Von Koch-like curves

Two Approaches to the Induction of Graph-Rewriting Rules for Function-Based Design Synthesis

2016 ◽  
Author(s):  
Julian R. Eichhoff ◽  
Felix Baumann ◽  
Dieter Roller
Keyword(s):  
Engineering Design ◽  
Conceptual Design ◽  
Automatic Generation ◽  
Production Rules ◽  
Design Synthesis ◽  
Graph Rewriting ◽  
Conceptual Engineering ◽  
Frequent Subgraph ◽  
Rule Set ◽  
Rewriting Rules

In this paper we demonstrate and compare two complementary approaches to the automatic generation of production rules from a set of given graphs representing sample designs. The first approach generates a complete rule set from scratch by means of frequent subgraph discovery. Whereas the second approach is intended to learn additional rules that fit an existing, yet incomplete, rule set using genetic programming. Both approaches have been developed and tested in the context of an application for automated conceptual engineering design, more specifically functional decomposition. They can be considered feasible, complementary approaches to the automatic inference of graph rewriting rules for conceptual design applications.

RESTARTING TILING AUTOMATA

2013 ◽  
Vol 24 (06) ◽  
pp. 863-878 ◽  
Author(s):  
DANIEL PRŮŠA ◽  
FRANTIŠEK MRÁZ
Keyword(s):  
Regular Languages ◽  
Two Dimensional ◽  
Scanning Strategy ◽  
Closure Properties ◽  
Computing Device ◽  
New Model ◽  
Picture Languages

We present a new model of a two-dimensional computing device called restarting tiling automaton. The automaton defines a set of tile-rewriting, weight-reducing rules and a scanning strategy by which a tile to rewrite is being searched. We investigate properties of the induced families of picture languages. Special attention is paid to picture languages that can be accepted independently of the scanning strategy. We show that this family strictly includes REC and exhibits similar closure properties. Moreover, we prove that its intersection with the set of one-row languages coincides with the regular languages.

Sign in / Sign up

Export Citation Format

Share Document