The aim of this paper is to introduce and investigate α∗-uniformity on a nonempty set X using α∗-covers of X in L-fuzzy set theory. Equivalent conditions for α∗-uniformity and basis to α∗-uniformity, respectively, are obtained. The topology generated by α∗-uniformity, called α∗-topology, is also given. Various examples of α∗-uniformity on X are given and the α∗-topology induced by them are also...

Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a Boolean value. The automata-theoretic approach for reasoning about Boolean-valued systems has proven to be very useful and powerful. We develop an automata-theoretic framework for reasoning about multi-valued objects, and describ...

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

and Applied Analysis 3 3. Main Results Throughout this paper, we will consider lattices as complete lattices,X will denote space, and μ is a membership function of any fuzzy set X. Definition 3.1. If m : σ L → R ∪ {∞} satisfies the following properties, then m is called a lattice measure on the lattice σ-algebra σ L . i m ∅ L0. ii For all f, g ∈ σ L such that m f , m g ≥ L0 : f ≤ g ⇒ m f ≤ m g ...