This paper addresses the problem of temporal-logic-based planning for bipedal robots in uncertain environments. We first propose an Interval Markov Decision Process abstraction locomotion (IMDP-BL). Motion perturbations from multiple sources uncertainty are incorporated into our model using stacked Gaussian process learning order to achieve formal guarantees on behavior system. consider tasks w...

In this paper, the concept of fuzzy local ω-language, Büchi fuzzy local ω-language are studied and we give some closure properties of fuzzy local ω-languages. We also establish relationship between deterministic fuzzy local automaton and fuzzy local ω-language. Further we show that every fuzzy regular ω-language is a projection of a Büchi fuzzy local ω-language.

For a givenweighted finite automaton over a strong bimonoid we construct its reducedNerode automaton, which is crisp-deterministic and equivalent to the original weighted automaton with respect to the initial algebra semantics.We show that the reducedNerode automaton is even smaller than theNerode automaton, which was previously used in determinization related to this semantics. We determine ne...

The quotient operator plays an important role for query evaluation in relational databases. Its extension to fuzzy databases raises the question of the intended interpretation of the intermediary degrees attached to the items in the fuzzy relations. This note points out that the fuzzy quotient operator should be defined in slightly different ways depending on the possible interpretations of the...

In the current study, we define different L-valued operators on LB-valued general fuzzy automata or simply GFA, where B is considered as a complete infinitely distributive lattice of propositions about GFA. particular, this study demonstrates that successor and predecessor induce co-topologies while residuated approximation topologies state set given Further, show continuity separation properti...

The partial derivative automaton (Apd) is usually smaller than other non-deterministic finite automata constructed from a regular expression, and it can be seen as a quotient of the Glushkov automaton (Apos). By estimating the number of regular expressions that have ε as a partial derivative, we compute a lower bound of the average number of mergings of states in Apos and describe its asymptoti...

We propose a new class of algebraic structure named as (m, n)-semihyperring which is a generalization of usual semihyperring. We define the basic properties of (m, n)-semihyperring like identity elements, weak distributive (m, n)semihyperring, zero sum free, additively idempotent, hyperideals, homomorphism, inclusion homomorphism, congruence relation, quotient (m, n)-semihyperring etc. We propo...