We prove that the group of reversible cellular automata (RCA), on any alphabet $A$, contains a subgroup generated by three involutions which an isomorphic copy every finitely RCA $B$. This result follows from

In this paper, we formalize precisely the sense in which application of a cellular automaton to partial configurations is natural extension its local transition function through categorical notion Kan extension. fact, two possible ways do such an and ingredients involved their definition are related extensions many ways. These relations provide additional links between computer science category...

Totalistic cellular automata were introduced by Wolfram [1, 2] as a means of studying higher-color cellular automata within a reasonable space of possible rules. The underlying principle is to systematically construct a subset of rules within all the possible rules of the highercolor cellular automata, and the system in totalistic cellular automata is to add up the values of the cells within th...

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...