In this paper, by presenting some notions and theorems, we obtaindifferent types of fuzzy topologies. In fact, we obtain someLowen-type  and Chang-type fuzzy topologies on general fuzzyautomata. To this end, first we define a Kuratowski fuzzy interioroperator which induces a  Lowen-type  fuzzy topology on the  set ofstates of a max- min general   fuzzy automaton. Also by  provingsome theorems, ...

We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular in Accelera’s Property Specification Language. We obtain results about the expressive power of fragments of this logic when restricted to certain operators only: basically, all operators alone suffice for expressive completeness...

We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that weighted monadic second order logics on trees is equivalent to the definability by formulas which start with one of the following operators: (i) a branching t...

We consider n-dimensional semi-algebraic spatial databases. We compute in first-order logic extended with a transitive closure operator, a linear spatial database which characterizes the semi-algebraic spatial database up to a homeomorphism. In this way, we generalize our earlier results to semi-algebraic spatial databases in arbitrary dimensions, our earlier results being true for only two dim...

In accordance with Tarski point of view, in this chapter the theory of closure operators is proposed as a unifying tool for fuzzy logics. Indeed, let F be the set of formulas of a given language. Then an abstract fuzzy logic is defined by a fuzzy semantics (i.e. a class of valuations of the formulas in F) and by a closure operator in the lattice of the fuzzy subsets of F (we call deduction oper...

We consider the Fokker–Planck operator with a strong external magnetic field. show maximal type estimate on this using nilpotent approach vector field polynomial operators and including notion of representation Lie algebra. This makes it possible to give an optimal characterization domain closure considered operator.

In this paper, the local function, weak semi-local function and closure are compared with each other according to inclusion relation. We define a new operator by using investigate its properties. Thanks operator, we obtain two topologies which finer than some previously defined topologies.

First introduced in the study of the Sturmian words, the iterated palindromic closure was generalized to pseudopalindromes. This operator allows one to construct words with infinitely many pseudopalindromic prefixes, called pseudostandard words. We provide here several combinatorial properties of the fixed points under the iterated pseudopalindromic closure.

The Abiteboul and Beeri algebra for complex objects can express a query whose meaning is transitive closure, but the algorithm naturally associated to this query needs exponential space. We show that any other query in the algebra which expresses transitive closure needs exponential space. This proves that in general the powerset is an intractable operator for implementing xpoint queries.

We define the notion of weak relative pseudo-complement on meet semi-lattices, and we show that it is strictly weaker than relative pseudo-complementation, but stronger than pseudo-complementation. Our main result is that if a complete lattice L is meet-continuous, then every closure operator on L admits weak relative pseudo-complements with respect to continuous closure operators on L.