in this paper, we define the concepts of a complex fuzzy subset and a complex fuzzy finite state automaton. then we extend the notion of a complex fuzzy finite state automaton and introduce the notion of a general complex fuzzy automaton. after that we define the concept of a max- min general complex fuzzy automaton and construct some equivalence relations and some congruence relations in a max...

the main goal of the present study was to implement a hybrid pattern of cellular automata model and particle swarm optimization algorithm based on tm and etm+ imagery of landsat satellite from 1988 to 2010 for simulating the urban sprawling. in this study, an alternative model was implemented in two ways: the first method was based on two images (1988 and 2010) and the second one was based on t...

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...

In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology for sand automata, and a new context in which sand automata are homeomorphic to cellular automata acting on a specific subshift. We show that the existing topological results for sand automata, including the Hedlund-lik...

The deterministic membership problem for timed automata asks whether the language given by a nondeterministic automaton can be recognised automaton. An analogous stated in setting of register automata. We draw complete decidability/complexity landscape problem, both and For automata, we prove that is decidable when input one-register (possibly with epsilon transitions) number registers output f...

Ultrametric automata have properties similar to the properties of probabilistic automata but the descriptional power of these types of automata can differ very much. In this paper, we compare ultrametric automata with deterministic, nondeterministic, probabilistic and alternating automata with various state complexities. We also show that two-way ultrametric automata can have a smaller state co...