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
Keywords
Related Articles
- EP ID EP94425
- DOI -
- Views 153
- Downloads 0
GENETIC ALGORITHM BASED APPROACH FOR THE SELECTION OF PROJECTS IN PUBLIC R&D INSTITUTIONS
Identification and selection of new project concepts are one of the crucial steps in the project selection process in research establishments. It is essential to ensure that objectives of proposed projects are evaluated...
0-EDGE MAGIC LABELING FOR SOME CLASS OF GRAPHS
In this paper we introduce new labeling called 0-Edge Magic Labeling, and also shown the existence of this Labeling for Some Class of graphs.
Spatial Fuzzy C-Means PET Image Segmentation of Neurodegenerative Disorder
Nuclear image has emerged as a promising research work in medical field. Images from different modality meet its own challenge. Positron Emission Tomography (PET) image may help to precisely localize disease to assist in...
DETECTION OF WINDOWS IN FACADES USING IMAGE PROCESSING ALGORITHMS
In this paper, a method for window detection in images of facades is presented. Windows play an important role in the context of deformation analysis of facades, and automatic detection from images is needed in novel, re...
Evaluation of the Signal to Noise in Different Radiographic Methods and in Standard Digitizer
Radiography is one of the methods to find volumetric defects in Non Destructive Technique (NDT). Radiographic film is digitized for the further assessment of the defects. The successful use of radiography depends on the...