Signals are a classical tool used in cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collisions formalize this idea one step further, describing regular nets of colliding signals. In the present paper, we investigate the use of particles and collisions for constructions involving an infinite number of interacting p...

A public-key cryptosystem based on inhomogeneous cellu lar automata is prop osed . The running time of all known algorithms for br eaking t he system grows exponenti ally with the cipher block length.

in this note, by considering the notions of the intuitionistic general l-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{l}$, there exists a minimal intuitionistic general l-fuzzy automaton recognizing $mathcal{l}$.we prove that the minimal intuitionistic general l-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...