we present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. first, we introduce a hyper bck-algebra induced by a max-min general fuzzy automaton. then, we study the properties of this hyper bck-algebra. particularly, some theorems and results for hyper bck-algebra are proved. for example, it is shown that this structure consists of different ty...

in this paper we proposed a cellular automaton based local algorithm to solve the autonomously sensor gathering problem in mobile wireless sensor networks (mwsn). in this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. the sensors decide to move only based on their local information. cellular automaton (ca) as dynamical sy...

In this paper, we extend the notion of (word) derivatives and partial due to (respectively) Brzozowski Antimirov tree using already known inductive formulae quotients. We define a new family extended regular expressions (using negation or intersection operators), show how compute Brzozowski-like automaton; fixed point construction, when it exists, is derivative automaton. Such deterministic aut...

due to the algorithmic simplicity, cellular automata (ca) models are useful and simple methods in structural optimization. in this paper, a cellular-automaton-based algorithm is presented for simultaneous shape and topology optimization of continuum structures, using five-step optimization procedure. two objective functions are considered and the optimization process is converted to the single ...

Madurai, (India) ABSTRACT In this paper we explore the finite automaton for n-cut splicing system. We propound a group structure for the automaton of splicing system. In addition, the product of automaton of splicing system with itself is scrutinized. It is found that the reconstructed machine from the product of automaton of splicing system is isomorphic to the automaton of splicing system. He...

In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...

Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...