نتایج جستجو برای: minimal bl general fuzzy automata
تعداد نتایج: 965842 فیلتر نتایج به سال:
Using hybrid automata, one is able to model many types of systems and express their properties in various formal languages. Being extremely general and rich, however, the class of hybrid automata exhibits the inherent problems of automata theory: even the simplest of properties for general hybrid automata are undecidable. Therefore, one must restrict attention only to subclasses of this very ge...
Taking intuitionistic fuzzy sets as the structures of truth values, we propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs, for short) and pushdown automata with final states (IFPDAs). Then we investigate algebraic characterization of intuitionistic fuzzy recognizable languages including decomposition form and representation theorem. By introducing the generalized subset c...
This material is studying MV-algebras and BL-algebras in terms of applicability in Boole algebra. Boole algebras are expanded use in fuzzy logic.
We consider the problem of reducing the number of states of nondeterministic finite automata, and show how to encode the reduction as a Boolean satisfiability problem. This approach improves on previous work by reducing a more general class of automata. Experimental results show that it produces a minimal automaton in almost all cases and that the running time compares favourably to the Kameda-...
Dubois. D. , Prade. H. 1980. Fuzzy Sets and Systems. Mathematics in Science and Engineering, Academic Press, New York, 144. Jun. Y. B. , Kavikumar. J. 2011. Bipolar Fuzzy Finite State Machines. Bull. Malays. Sci. Soc. 34 no. 1: 181-188. Kandel. A. , Lee. S. C. Fuzzy Switching and Automata Theory Applications. Edward Arnold Publishers Ltd, London. Lee. K. J. 2000. Bipolar-valued fuzzy sets and t...
Neurofuzzy systems—the combination of artificial neural networks with fuzzy logic—have become useful in many application domains. However, conventional neurofuzzy models usually need enhanced representational power for applications that require context and state (e.g., speech, time series prediction, control). Some of these applications can be readily modeled as finite state automata. Previousl...
Dubois. D. , Prade. H. 1980. Fuzzy Sets and Systems. Mathematics in Science and Engineering, Academic Press, New York, 144. Jun. Y. B. , Kavikumar. J. 2011. Bipolar Fuzzy Finite State Machines. Bull. Malays. Sci. Soc. 34 no. 1: 181-188. Kandel. A. , Lee. S. C. Fuzzy Switching and Automata Theory Applications. Edward Arnold Publishers Ltd, London. Lee. K. J. 2000. Bipolar-valued fuzzy sets and t...
Here we study the notions of lattice-valued finite state machine and lattice-valued fuzzy transformation semigroup when the lattice consists of all the closed subintervals contained in [0, 1]. So, we can apply techniques of interval-valued fuzzy sets to fuzzy automata. In particular, we prove that Atanassov’s Kα operators allow us to retrieve the information given by the transition functions of...
The purpose of the present work is to introduce the concept of bifuzzy core of a fuzzy automaton, which induces a bifuzzy topology on the state-set of this fuzzy automaton. This is shown that this bifuzzy topology can be used to characterize the concepts such as bifuzzy family of submachines, bifuzzy separable family and bifuzzy retrievable family of a fuzzy automaton.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید