Automata theory plays a key role in computational theory as many computational problems can be solved with its help. Formal grammar is a special type of automata designed for linguistic purposes. Formal grammar generates formal languages. Rough grammar and rough languages were introduced to incorporate the imprecision of real languages in formal languages. These languages have limitations on un...

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

Classical automata theory cannot deal with the system uncertainty. To deal with the system uncertainty the concept of fuzzy finite automata was proposed. Fuzzy automata can be used in diverse applications such as fault detection, pattern matching, measuring the fuzziness between strings, description of natural languages, neural network, lexical analysis, image processing, scheduling problem and...

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

[2] Karsten Lehmann and Rafael Peñaloza. The complexity of computing the behaviour of lattice automata on infinite trees. On the decidability status of fuzzy ALC with general concept inclusions. [4] Stefan Borgwardt and Rafael Peñaloza. Consistency reasoning in lattice-based fuzzy description logics. Context-dependent views to axioms and consequences of semantic web ontologies. Classifying soft...

Classical automata theory can not deal with uncertainty. To deal with uncertainty in system modeling, fuzzy automata come into the existence. Fuzzy automaton depends on membership value. For finding the membership degree of strings in fuzzy automata, the concept of max – min automaton and min – max automaton can be used. Many researchers have used the concept of max – min automaton for finding ...

We consider the state complexity of extensions of the Kleene star and quotient operations to unranked tree languages. Due to the nature of the tree structure, there are two distinct ways to define the star operation for trees, we call these operations, respectively, bottom-up and top-down star. We show that (n+ 3 2 )2 states are sufficient and necessary in the worst case to recognize the bottom...

Fuzzy Cellular Automata (FCA) are special couple map lattices that generalize Boolean cellular automata by allowing continuous values for the cell states. The local transition rule of a FCA is the “fuzzification" of the disjunctive normal form that describes the local function of the corresponding Boolean cellular automata. Recently there has been some interest in elementary Fuzzy cellular auto...

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.