This paper deals with the reconstructibility of Boolean control networks (BCNs) with time delays in states. First, a survey on the semi-tensor product, weighted pair graph, constructed forest and finite automata is given. Second, by using the weighted pair graph, constructed forest and finite automata, an algorithm is designed to judge whether a Boolean control network with time delays in states is reconstructable or not under a mild assumption. Third, an algorithm is proposed to determine the current state. Finally, an illustrative example is given to show the effectiveness of the proposed method.
The oldest butterfly fossil known, which was formed about 55 Ma in what is now Denmark, is described. The fragments of its forewing venation indicates it belongs to the Hesperiidae. Further reconstruction indicates that it fits in the Coeliadinae and is close to the extant genera Hasora and Burara. It is here described as Protocoeliades kristenseni gen. et sp. n. It is the first butterfly fossil found on a continent (Europe) where its closest relatives do not currently occur. Its position on the phylogenetic tree of the Coeliadinae and its importance in understanding the time dimension in the evolution of butterflies, and their ecological and biogeographic implications are discussed., Rienk De Jong., and Obsahuje bibliografii