In this paper, we study the structure of underlying automata based constructions for solving the LTL realizability problem. We show how to reduce the LTL realizability problem to a game with an observer which checks that the game visits a bounded number of times accepting states of a universal co-Büchi word automaton. We show that such an observer can be made deterministic and that this determi...

When two nominal constituents are in a relation of dependency in the Bantu languages, the syntactically dependent constituent is usually introduced by a relator. In Bantu studies this relator is called connective (also associative, genitive or connexive) element (or pronoun, clitic, prefix, marker or particle). The order is HEAD (R1) RELATOR (REL) DEPENDENT (R2). R1 and R2 are short for first a...

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, under a \call by value" evaluation strategy. This proves that in general the powerset is an intractable op...

in this paper, we dene and study two operators s and s with grill.characterization and basic properties of these operators are obtained. also,we generalize a grill topological spaces via topology  s induced from operatorss and s.

in this paper we study properties of symbols such that these belong to class of symbols sitting insidesm ρ,φ that we shall introduce as the following. so for because hypoelliptic pseudodifferential operatorsplays a key role in quantum mechanics we will investigate some properties of m−hypoelliptic pseudodifferential operators for which define base on this class of symbols. also we consider maxi...

this paper presents characterizations of m-fuzzifying matroids bymeans of two kinds of fuzzy operators, called m-fuzzifying derived operatorsand m-fuzzifying difference derived operators.

in this paper, we consider weighted composition operators betweenmeasurable differential forms and then some classic properties of these operators are characterized.

Various models and languages for describing and manipulating hierarchically structured data have been proposed. Algebraic, calculus-based and logic-programming oriented languages have all been considered. This paper presents a general model for complex objects, and languages for it based on the three paradigms. The algebraic language generalizes those presented in the literature; it is shown to...

We introduce the equational notion of a monadic bounded algebra (MBA), intended to capture algebraic properties of bounded quantification. The variety of all MBA’s is shown to be generated by certain algebras of two-valued propositional functions that correspond to models of monadic free logic with an existence predicate. Every MBA is a subdirect product of such functional algebras, a fact that...