نتایج جستجو برای: quotient bl general fuzzy automaton

تعداد نتایج: 843237  

2011
Wenjuan Chen

In this paper, the intuitionistic fuzzy Lie sub-superalgebras and ideals of Lie superalgebras are studied further. We define the intuitionistic fuzzy quotient Lie superalgebra by an intuitionistic fuzzy Lie ideal and prove that it is a Lie superalgebra. The intuitionistic fuzzy set of quotient Lie superalgebra is also considered. Finally, solvable intuitionistic fuzzy Lie ideals and nilpotent i...

1995
Oleg Sokolsky Scott A. Smolka

We present a local algorithm for model checking in a real-time extension of the modal mu-calculus. As such, the whole state space of the real-time system under investigation need not be explored, but rather only that portion necessary to determine the truthhood of the logical formula. To the best of our knowledge, this is the rst local algorithm for the veriication of real-time systems to appea...

Journal: :international journal of occupational hygiene 0
hossein kakooei department of occupational health, school of public health, tehran university of medical sciences, tehran, iran mohammad hadi rahimi department of occupational health, school of public health, tehran university of medical sciences, tehran, iran mostafa hosseini department of biostatistics, school of public health, tehran university of medical sciences, tehran,

research has shown that shift work, in particular night work, can have negative effects on the health, safety and well-being of workers. our study assessed, in a hospital setting, the effects of bright light (bl) on general health and psychological problems during night shift work. in an experimental design, 15 female nurses at a general hospital that located in tehran were exposed to moderate ...

2014
Ludovic Mignot Nadia Ouali Sebti Djelloul Ziadi

There exist several methods of computing an automaton recognizing the language denoted by a given regular expression: In the case of words, ones can compute the position automaton P due to Glushkov, the c-continuation automaton C due to Champarnaud and Ziadi, the follow automaton F due to Illie and Yu and the equation automaton E due to Antimirov. It has been shown that P and C are isomorphic a...

Journal: :International Journal of Approximate Reasoning 2001

In this paper we introduce the notions of fuzzy transposition hypergroupsand fuzzy regular relations and investigate their basic properties.We also study fuzzy quotient hypergroups of a fuzzy transposition hypergroup.

Journal: :Inf. Sci. 2008
Jirí Rachunek Dana Salounová

The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. The sets of provable formulas in corresponding inference systems from the point of view of uncertain information can be described by fuzzy filters of those algebraic semantics. Bounded residuated lattice ordered monoids (R`-monoids) are a common generalization of pseudo ...

Journal: :Soft Comput. 2006
Masoud Haveshki Arsham Borumand Saeid Esfandiar Eslami

In this paper we introduce some types of filters in a BL algebra A, and we state and prove some theorems which determine the relationship between these notions and other filters of a BL algebra, and by some examples we show that these notions are different. Also we consider some relations between these filters and quotient algebras that are constructed via these filters. Mathematics Subject Cla...

1998
Václav Snásel

We explain new ways of constructing search algorithms using fuzzy sets and fuzzy automata. This technique can be used to search or match strings in special cases when some pairs of symbols are more similar to each other than the others. This kind of similarity can’t be handled by usual searching algorithms. We present sample situations, which would use this kind of searching. Then we define a f...

2015
Eva Maia Nelma Moreira Rogério Reis

Recently, Yamamoto presented a new method for the conversion from regular expressions (REs) to non-deterministic finite automata (NFA) based on the Thompson ε-NFA (AT ). The AT automaton has two quotients considered: the suffix automaton Asuf and the prefix automaton, Apre. Eliminating ε-transitions in AT , the Glushkov automaton (Apos) is obtained. Thus, it is easy to see that Asuf and the par...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید