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 158
- Downloads 0
Comparative Study of Perturbation and Cryptography in PPDM
In this paper, we studied technique for the perturbation and cryptography method. In developing this new theoretical basis we measure data utility and disclosure risk. Basically we compare random rotation and cryptograph...
COMPARATIVE STUDY OF NEXT GENERATION HIGH SPEED WIRELESS NETWORKS
Advances in mobile communication theory have enabled the development of different wireless access technologies. Alongside the revolutionary progress in wireless access technologies, advances in wireless access devices su...
Wireless Sensor Network MAC Protocol: SMAC & TMAC
Wireless sensor networks is an emergent technology which has made Ambient Intelligence a reality. It consists of several tiny nodes connected to each other in Ad hoc environment and coordinate with each other to form a n...
PROPOSED PROFILE TRANSLATION IN CONTEXT AWARE PROACTIVE SYSTEM
The advancement of mobile devices and Internet has given us great platform for our day to day tasks. Various Activities like ticket booking; shopping, paying bills have been done on the fly.The Smartphone adds portabilit...
An Optimized Secure Communication Using VLR-GS-BU on Wireless Network
A novel protocol to achieve privacy-preserving universal authentication protocol for wireless communications called Priauth. to secure the communication as the data are sensitive or it requires the users to pay for it. I...