String Rewriting Grammar Optimized Using an Evolvability Measure

Authors:
Hideaki Suzuki
Affiliations:
-
Venue:
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
Year:
2001

Citing 10
Cited 0

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Emergence of self-replicating structures in a cellular automata space

Physica D
Self-evolution in a constructive binary string system

Artificial Life
Self-replicating structures: evolution, emergence, and computation

Artificial Life - Special issue on self-replication
An approach to biological computation: unicellular core-memory creatures evolved using genetic algorithms

Artificial Life
Evolution of self-reproducing programs in a core propelled by parallel protein execution

Artificial Life
The evolution and understanding of hierarchical complexity in biology from an algrbraic perspective

Artificial Life
Coevolution of Machines and Tapes

Proceedings of the Third European Conference on Advances in Artificial Life
On Self-Reproduction and Evolvability

ECAL '99 Proceedings of the 5th European Conference on Advances in Artificial Life
Automatic discovery of self-replicating structures in cellularautomata

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

As an example of the automatic optimization of an Artificial Life system design, a string rewriting system is studied. The system design is represented by a set of rewriting rules that defines the growth of strings, and a rule set is experimentarily optimized in terms of maximizing the evolvability measure, that is, the occurrence ratio of self-replicating strings. It is shown that the most optimized rule set allows many strings to self-replicate by using a special character able to copy an original string sequentially. In the paper, a man-made rule set is also presented and is compared to the optimized rule set.