In the present work, we further study the computational power of virus machines (VMs in short).VMs provide a computing paradigm inspired by the transmission and replication networks of viruses.VMs consist of process units (called hosts) structured by a directed graph whose arcs are called channels and an instruction graph that controls the transmissions of virus objects among hosts. The present work complements our understanding of the computing power of VMs by introducing normal forms; these expressions restrict the features in a given computing model.Some of the features that we restrict in our normal forms include (a) the number of hosts, (b) the number of instructions, and (c) the number of virus objects in each host. After we recall some known results on the computing power of VMs we give our series of normal forms, such as the size of the loops in the network, proving new characterisations of family of sets, such as finite sets, semilinear sets, or recursively enumerable sets (NRE).

翻译：本文进一步探讨了病毒机器（简称VMs）的计算能力。病毒机器是一种受病毒传播与复制网络启发的计算范式，由称为宿主的过程单元组成，这些单元通过有向图（其边称为通道）和指令图（控制病毒对象在宿主间的传输）构建而成。本研究通过引入范式来补充对病毒机器计算能力的理解；这些表达式限制了给定计算模型中的特性。我们范式中限制的部分特性包括：（a）宿主数量，（b）指令数量，以及（c）每个宿主中的病毒对象数量。在回顾病毒机器计算能力的已知结果后，我们提出了一系列范式，例如网络中循环的大小，从而证明了集合族（如有限集、半线性集或递归可枚举集（NRE））的新特征描述。