Frequency-emulated uniform cellular automata

The notion of a frequency-emulated (f-emulated) uniform cellular automata (CA) that enables the behavior emulation of some elementary CA via memory usage is introduced. An algorithm that generates f-emulated uniform CA sets is developed and an upper bound for its output size is given. It is observed that traffic rule 184 together with its 2-emulator version, which generates the behavior of the known majority rule 232, performs the density classification task perfectly. Moreover, it is possible to use a 2-emulated uniform CA for the solution of the parity problem.