Alternative Vidhi to Conversion of Cyclic CNF->GNF
Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2012, Vol 3, Issue 1
Abstract
In automata theory Greibach Normal Form shows that A->aV n*, where ‘a’ is terminal symbol and Vn is nonterminal symbol where * shows zero or more rates of Vn [1]. Most popular questions, conversion of following cyclic CNF into GNF are: Question 1 S->AA | a, A->SS | b Question 2 S->AB, A->BS | b, B->SA | a Question 3 S->AB, A->BS | b, B->AS | a [1] To solve these questions, we need two technical lemmas and required one or more another variable like Z1. In these questions, we have cyclic nature of production called cyclic CNF. We have modified the same rule by which we get the more reliable answer with less number of productions in right hand side without using lemmas and any another variable. This above method can be applied on all problems by which we produce the GNF.
Authors and Affiliations
Avinash Bansal
Keywords
Related Articles
- EP ID EP649899
- DOI 10.24297/ijct.v3i1b.6778
- Views 69
- Downloads 0
Filtering and Transformation Model for Opinion Summarization
The rapid evolution of Micro blogging sites such as Blogs & Twitter facilitate people to post real time messages about their opinions on a variety of topics inclusive of products they use in their daily life. Summari...
Offline Signature Verification System with Gaussian Mixture Models (GMM)
Gaussian Mixture Models (GMMs) has been proposed for off-line signature verification. The individual Gaussian components are shown to represent some global features such as skewness, kurtosis, etc. that characterize vari...
Measuring Radar Signatures of a Simple Pendulum using Cantenna Radar
This paper gives a detailed analysis of the physics of simple pendulum and the equations governing the motion and velocity. The pendulum works in three modes: simple, damped and driving and driving only. The signatures a...
ANALYSIS AND SYNTHESIS OF ENHANCED ANT COLONY OPTIMIZATION WITH THE TRADITIONAL ANT COLONY OPTIMIZATION TO SOLVE TRAVELLING SALES PERSON PROBLEM
Ant Colony optimization is a heuristic technique which has been applied to a number of combinatorial optimization problem and is based on the foraging behavior of the ants. Travelling Salesperson problem is a combinatori...
ALLOCATION OF HETEROGENOUS CLOUDLETS ON PRIORITY BASIS IN CLOUD ENVIRONMENT
Load balancing is one of the main challenges in cloud computing which is required to distribute the dynamic workload across multiple nodes to ensure that no single node is overwhelmed. It helps in optimal utilization of...