Fuzzy tree automata are mathematical devices for modeling and analyzing vaguely defined structures. The behavior of a fuzzy automaton generates language by mapping set regular trees on ranked alphabet to membership values. It calculates the grade using rules that process their structural characteristics. This paper deals with constructing models satisfies given logical propositions (called prop...

A notion of reticulation which provides topological properties on algebras has introduced on commutative rings in 1980 by Simmons in [5]. For a given commutative ring A, a pair (L, λ) of a bounded distributive lattice and a mapping λ : A → L satisfying some conditions is called a reticulation on A, and the map λ gives a homeomorphism between the topological space Spec(A) consisting of prime fil...

In this paper the concept of prob'abilistic events is introduced and their closure properties under the operations on the set of all fuzzy events are studied. I t is shown that the mean of probabilistie events is a probabilistie event and the set of all probabilistie events is closed under the transposition and the operation of the convex-combination. A sufficient conditioll for the union and t...

In this project, the computations of synthesis to co-Büchi properties are worked out. The procedures used to compute the most general solution is very similar to what has been used in regular automaton cases. The most general solution is turned to a particular solution by splitting it into a path automaton and an acceptance automaton. The cycles in the path automaton graph are trimmed while the...

We study the pattern matching automaton introduced in [1] for the purpose of seed-based similarity search. We show that our definition provides a compact automaton, much smaller than the one obtained by applying the Aho-Corasick construction. We study properties of this automaton and present an efficient implementation of the automaton construction. We also present some experimental results and...

We study the pattern matching automaton introduced in [1] for the purpose of seed-based similarity search. We show that our definition provides a compact automaton, much smaller than the one obtained by applying the Aho-Corasick construction. We study properties of this automaton and present an efficient implementation of the automaton construction. We also present some experimental results and...

In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...

In this paper we have investigated the performance of some stochastic methods for solving constraint satisfaction (CSP) and fuzzy constraint satisfaction problems (FCSP). The purpose of this paper is to study the abilities of learning automaton in solving these problems and comparing it with other stochastic methods. The results confirm those of [2] and show its superiority to other methods.