A GENETIC ALGORITHM FOR FINITE STATE AUTOMATA
Journal Title: Indian Journal of Computer Science and Engineering - Year 2014, Vol 5, Issue 4
Abstract
The genetic algorithm is described, including its three main steps: selection, crossover, and mutation. A comparison between implementation costs and running times of regular expressions matching a string is then made. The aim of this paper is to describe and analyze the behavior of an implementation of a non-deterministic finite-state acceptor using a genetic algorithm.
Authors and Affiliations
Aviral Takkar
DECISION SUPPORT SYSTEM IS A TOOL FOR MAKING BETTER DECISIONS IN THE ORGANIZATION
Information plays a major role in any organization. The value of information depends on its application and use. The success of an organization largely depends on the quality of the information that it generates. The inf...
SOFTWARE RELIABILITY OF PROFICIENT ENACTMENT
A software reliability exemplary projects snags the random process as disillusionments which were the culmination yield of two progressions: emerging faults and initial state values. The predominant classification uses t...
Comparative Study of Adhoc Routing Protocol AODV, DSR and DSDV in Mobile Adhoc NETwork
A Mobile Ad hoc NETwork is a kind of wireless ad-hoc network, and is a self configuring network of mobile routers connected by wireless links. Mobile Ad-Hoc Network (MANET) is a wireless network without infrastructure. S...
FUZZY LOGIC APPLICATION IN POWER SYSTEM FAULT DIAGNOSIS
Fuzzy logic allows a convenient way to incorporate the knowledge of human experts into the expert systems using qualitative and natural language-like expressions. Recent advances in the field of fuzzy systems and a numbe...
Implementation of Calendar Chart in CICS Mainframes for Business Analysis
This paper provides a business solution to implement Calendar Chart in Mainframes for analysing the progress of a Bank by giving detailed report of number of new accounts created for the bank. A calendar chart is a visua...