Abstract. We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as...
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
The CLA-EC is a model obtained by combining the concepts of cellular learning automata and evolutionary algorithms. The parallel structure of the CLA-EC makes it suitable for hard...
Large areas of savannas are found in Africa in climatic zones favourable to humid tropical forests: they are relicts of past dry periods and forest domains are naturally expanding....
Cancer is an evolutionary process; mutated cells are selected for abnormal growth and survivability. Here, a computer simulation is used to model ductal carcinoma in situ (DCIS), ...