IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Local Languages and Their Application to DNA Sequence Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
Splicing representations of strictly locally testable languages
Discrete Applied Mathematics
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Learning Concatenations of Locally Testable Languages from Positive Data
AII '94 Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory
Theory of cellular automata: a survey
Theoretical Computer Science
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Journal of the ACM (JACM)
Logical reversibility of computation
IBM Journal of Research and Development
| Hi-index | 0.00 |
We propose Mutation Systems as a model of the evolution of a string subject to the effects of mutations and a fitness function. One fundamental question about such a system is whether knowing the rules for mutations and fitness, we can predict whether it is possible for one string to evolve into another. To explore this issue we define a specific kind of mutation system with point mutations and a fitness function based on conserved strongly k-testable string patterns. We show that for k ≥ 2, such systems can simulate computation by both finite state machines and asynchronous cellular automata. The cellular automaton simulation shows that in this framework, universal computation is possible and the question of whether one string can evolve into another is undecidable. We also analyze the efficiency of the finite state machine simulation assuming random point mutations.