In this paper, the concepts of somewhat fuzzy automata continuous functions and somewhat fuzzy automata open functions in fuzzy automata topological spaces are introduced and some interesting properties of these functions are studied. In this connection, the concepts of fuzzy automata resolvable spaces and fuzzy automata irresolvable spaces are also introduced and their properties are studied.

We define and characterize a somewhat fuzzy γ-irresolute continuous mapping and a somewhat fuzzy irresolute γ-open mapping on a fuzzy topological space. AMS Mathematics Subject Classification : 54A40.

The concept of  somewhat pairwise fuzzy $alpha$-irresolute continuous mappings and somewhat pairwise fuzzy irresolute $alpha$-open mappings have been introduced and studied. Besides, some interesting properties of those mappings are given.

In this paper the concept of somewhat pairwise fuzzy faintly -continuous functions and somewhat pairwise fuzzy faintly -open functions are introduced. Some interesting properties of these functions are investigated besides giving some characterizations of these functions.

Fuzzy Cellular Automata (FCA) are special couple map lattices that generalize Boolean cellular automata by allowing continuous values for the cell states. The local transition rule of a FCA is the “fuzzification" of the disjunctive normal form that describes the local function of the corresponding Boolean cellular automata. Recently there has been some interest in elementary Fuzzy cellular auto...

In this paper the concepts of somewhat fuzzy δ-continuous functions, somewhat fuzzy δ-open functions between fuzzy topological spaces are introduced and studied. Besides giving characterizations of these functions, several interesting properties of these functions are studied. The concepts of fuzzy δ-resolvable spaces and fuzzy δ-irresolvable spaces are also introduced and studied in this paper...

1. Introduction Cellular Automata have generated much interest [1,2,3] because of their diverse behavior and usefulness as a discrete model for many processes. Wolfram's 1984 paper on universality and complexity in cellular automata [3,4] described four classes of behavior for automata: class 1 for homogeneous stable behavior, class 2 for simple periodic patterns, class 3 for chaotic aperiodic ...