Controlled Fuzzy Parallel Rewriting

We study a Lindenmayer-like parallel rewriting system to model the growth of filaments (arrays of cells) in which developmental errors may occur. In essence this model is the fuzzy analogue of the derivation-controlled iteration grammar. Under minor assumptions on the family of control languages and on the family of fuzzy languages in the underlying iteration grammar, we show (i) regular control does not provide additional generating power to the model, (ii) the number of fuzzy substitutions in the underlying iteration grammar can be reduced to two, and (iii) the resulting family of fuzzy languages possesses strong closure properties, viz. it is a full hyper-AFFL, i.e., a hyper-algebraically closed full Abstract Family of Fuzzy Languages

Characterization of uniform and hybrid cellular automata with null boundary

In this article, we dispute about the characterization of Cellular automata with restricted vertical neighborhood and Von neumann neighborhood of null boundary conditions over the field Z₂ in uniform cellular automata and hybrid cellular automata. Transition rule matrix for uniform and hybrid cellular automara with null boundary condition is obtained and the reversibility of the uniform cellular automata studied.Publisher's Versio