PETRI NETS GENERATING KOLAM PATTERNS
Journal Title: Indian Journal of Computer Science and Engineering - Year 2012, Vol 3, Issue 1
Abstract
Array Token Petri Nets are known to generate all the nine families generated by Array Grammars [10]. Application of two dimensional array grammars in kolam generation has been discussed [1]. Motivated by this we have used Array Token Petri Nets to generate kolam patterns. Parallel generation and sequential/parallel generation are the two types of generation used. The Kolam patterns which are generated by Regular Grammars are generated by Array Token Petri Nets and Kolam patterns which are generated by Context-free and Contextsensitive grammars are generated by Array Token Petri Nets with inhibitor arcs.
Authors and Affiliations
D. Lalitha , K. Rangarajan
Keywords
Related Articles
- EP ID EP124804
- DOI -
- Views 114
- Downloads 0
SV MACHINES FOR FUNCTION ESTIMATION COVERING QUADRATIC PROGRAMMING WITH LARGE DATA SETS USING FOR INTERIOR POINT ALGORITHM
Support Vector Machines (SVM) algorithms combine the simplicity and computational efficiency of linear algorithms, such as the perception algorithm or ridge regression, with the flexibility of nonlinear systems, like neu...
BIO-PROGRAMMING PROSPECTS OF JAVA: A COMPUTATIONAL MOVE TOWARDS THE UNDERSTANDING OF THE BIOLOGICAL ASPECTS OF GENES AND PROTEINS
Java is a powerful object oriented programming language that dominates many other programming languages for more than a decade. It is well designed and available as many executable technologies for software development s...
AN IMPROVEMENT OF MINH’S ALGORITHM FOR GENERATING GAMMA VARIATES WITH ANY VALUE OF SHAPE PARAMETER
The algorithm of Minh as in [Minh (1988)] was used to generate variates having a gamma distribution with shape parameter a>1 only. In this paper, a method, which is the improvement of the algorithm of Minh is introduc...
A Sorting based Algorithm for the Construction of Balanced Search Tree Automatically for smaller elements and with minimum of one Rotation for Greater Elements from BST
Tree is a best data structure for data storage and retrieval of data whenever it could be accommodated in the memory. At the same time, this is true only when the tree is height-balanced and lesser depth from the root. I...
FlyPS – A PRICING AND QOS MODEL FOR PERVASIVE COMPUTING WITH AN AIRPORT ILLUSTRATION
Pervasive Computing is the future technology for every living being that enables all time computing without his/her interaction. i.e any time, any where. Customer Assistance and Passenger Support are the prime factors fo...