Abstract
We study a versatile model of evolving interactive computing: lineages of automata. A lineage consists of a sequence of interactive finite automata, with a mechanism of passing information from each automaton to its immediate successor. Lineages enable a definition of a suitable complexity measure for evolving systems. We show several complexity results, including a hierarchy result. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Verbaan, P., Van Leeuwen, J., & Wiedermann, J. (2004). Complexity of evolving interactive systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3113, 268–281. https://doi.org/10.1007/978-3-540-27812-2_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
