Mutation systems

DOI10.1080/00207160.2012.715642zbMath1294.68079OpenAlexW2914160438MaRDI QIDQ2855745

Raonne Barbosa Vargas, Dana Angluin, James Aspnes

Publication date: 22 October 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.715642

zbMATH Keywords

cellular automatafinite automatapoint mutationsreversible computation\(k\)-testable languagesmutation systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Cites Work

• Unnamed Item
• Computing by observing: simple systems and simple observers
• Splicing representations of stricly locally testable languages
• Theory of cellular automata: a survey
• Evolution and observation -- a non-standard way to generate formal languages
• Characterizations of locally testable events
• Mutation Systems
• Logical Reversibility of Computation
• Evolvability

This page was built for publication: Mutation systems