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
SPEECH RECOGNITION USING GENERIC SHORTEST DISTANCE ALGORITHM
The first major contribution of this paper may well be a dialog model support propositional content and intentions. Two distinct components of the model square measure mentioned in depth: (a) associate approach to the mo...
A NOVEL APPROACH TO TEST SUITE REDUCTION USING DATA MINING
Software testing is the most important and time consuming part of software development lifecycle. The time spent in testing is mainly concerned with generating the test cases and testing them. Our goal is to reduce the t...
ENGLISH ALPHABET RECOGNITION USING CHAIN CODE AND LCS
Since several decades OCR system is getting more and more useful in daily life for various purposes. Many researches have been done on many types of characters by using different approaches. However very little investiga...
CLOUD COMPUTING: A NEW PARADIGM FOR DATA STORAGE IN INDIAN UNIVERSITIES
This article focuses on the future scope of cloud computing for universities in India. Such new technology can be utilized in management of educational activities using IT for modernization and development of educational...
NETWORK INTRUSION DETECTION SYSTEM USING FUZZY LOGIC
IDS which are increasingly a key part of system defense are used to identify abnormal activities in a computer system. In general, the traditional intrusion detection relies on the extensive knowledge of security experts...