A New General Class of Fuzzy Flip-Flop Based on Türkşen s Interval Valued Fuzzy Sets

Similar documents
Optimizing Fuzzy Flip-Flop Based Neural Networks by Bacterial Memetic Algorithm

EXPERIMENT: 1. Graphic Symbol: OR: The output of OR gate is true when one of the inputs A and B or both the inputs are true.

Department of CSIT. Class: B.SC Semester: II Year: 2013 Paper Title: Introduction to logics of Computer Max Marks: 30

1. Convert the decimal number to binary, octal, and hexadecimal.

The word digital implies information in computers is represented by variables that take a limited number of discrete values.

Reconfigurable Universal Fuzzy Flip-Flop: Applications to Neuro-Fuzzy Systems

Lecture 11: Synchronous Sequential Logic

Chapter 5 Sequential Circuits

B.Tech CSE Sem. 3 15CS202 DIGITAL SYSTEM DESIGN (Regulations 2015) UNIT -IV

CHAPTER 4: Logic Circuits

CHAPTER 4: Logic Circuits

Chapter 5: Synchronous Sequential Logic

Using minterms, m-notation / decimal notation Sum = Cout = Using maxterms, M-notation Sum = Cout =

EE292: Fundamentals of ECE

UNIT 1: DIGITAL LOGICAL CIRCUITS What is Digital Computer? OR Explain the block diagram of digital computers.

Applying Bacterial Memetic Algorithm for Training Feedforward and Fuzzy Flip-Flop based Neural Networks

Find the equivalent decimal value for the given value Other number system to decimal ( Sample)

ELCT201: DIGITAL LOGIC DESIGN

Unit 11. Latches and Flip-Flops

Digital Logic Design Sequential Circuits. Dr. Basem ElHalawany

MC9211 Computer Organization

Universidad Carlos III de Madrid Digital Electronics Exercises

Part II. Chapter2: Synchronous Sequential Logic

Chapter. Synchronous Sequential Circuits

Section 6.8 Synthesis of Sequential Logic Page 1 of 8

ECE 301 Digital Electronics

CSE Latches and Flip-flops Dr. Izadi. NOR gate property: A B Z Cross coupled NOR gates: S M S R Q M

UNIT III. Combinational Circuit- Block Diagram. Sequential Circuit- Block Diagram

Chapter 3. Boolean Algebra and Digital Logic

Chapter 4. Logic Design

COE 202: Digital Logic Design Sequential Circuits Part 1. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:

Sequential Circuits. Output depends only and immediately on the inputs Have no memory (dependence on past values of the inputs)

WEEK 10. Sequential Circuits: Analysis and Design. Page 1

MODU LE DAY. Class-A, B, AB and C amplifiers - basic concepts, power, efficiency Basic concepts of Feedback and Oscillation. Day 1

THE KENYA POLYTECHNIC

Digital Circuit And Logic Design I. Lecture 8

Digital Circuit And Logic Design I

Chapter 8 Sequential Circuits

Course Administration

A Review of logic design

Analysis of Clocked Sequential Circuits

REPEAT EXAMINATIONS 2002

Logic and Computer Design Fundamentals. Chapter 7. Registers and Counters

Chapter 11 State Machine Design

`COEN 312 DIGITAL SYSTEMS DESIGN - LECTURE NOTES Concordia University

Computer Architecture and Organization

Solution to Digital Logic )What is the magnitude comparator? Design a logic circuit for 4 bit magnitude comparator and explain it,

DIGITAL SYSTEM DESIGN UNIT I (2 MARKS)

More design examples, state assignment and reduction. Page 1

Where Are We Now? e.g., ADD $S0 $S1 $S2?? Computed by digital circuit. CSCI 402: Computer Architectures. Some basics of Logic Design (Appendix B)

1.b. Realize a 5-input NOR function using 2-input NOR gates only.

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-III SEQUENTIAL CIRCUITS

Final Exam review: chapter 4 and 5. Supplement 3 and 4

Combinational / Sequential Logic

Logic Design ( Part 3) Sequential Logic- Finite State Machines (Chapter 3)

CS6201 UNIT I PART-A. Develop or build the following Boolean function with NAND gate F(x,y,z)=(1,2,3,5,7).

Chapter 5 Synchronous Sequential Logic

UNIVERSITY OF MASSACHUSSETS LOWELL Department of Electrical & Computer Engineering Course Syllabus for Logic Design Fall 2013

Digital Circuits. Electrical & Computer Engineering Department (ECED) Course Notes ECED2200. ECED2200 Digital Circuits Notes 2012 Dalhousie University

New Components for Building Fuzzy Logic Circuits

EC6302-DIGITAL ELECTRONICS II YEAR /III SEMESTER ECE ACADEMIC YEAR

10.1 Sequential logic circuits are a type of logic circuit where the output of the circuit depends not only on

Introduction to Digital Electronics

UNIT IV. Sequential circuit

Sequential Logic Circuits

Synchronous Sequential Logic

CS61C : Machine Structures

St. MARTIN S ENGINEERING COLLEGE

D Latch (Transparent Latch)

MODULE 3. Combinational & Sequential logic

BCN1043. By Dr. Mritha Ramalingam. Faculty of Computer Systems & Software Engineering

1. a) For the circuit shown in figure 1.1, draw a truth table showing the output Q for all combinations of inputs A, B and C. [4] Figure 1.

ELCT201: DIGITAL LOGIC DESIGN

Course Plan. Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes (POs) PSO-1 PSO-2

To design a sequential logic circuit using D-Flip-flop. To implement the designed circuit.

Other Flip-Flops. Lecture 27 1

211: Computer Architecture Summer 2016

Digital Design, Kyung Hee Univ. Chapter 5. Synchronous Sequential Logic

YEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING. EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad ELECTRICAL AND ELECTRONICS ENGINEERING

Synchronous Sequential Logic

The basic logic gates are the inverter (or NOT gate), the AND gate, the OR gate and the exclusive-or gate (XOR). If you put an inverter in front of

Midterm Examination II

Code No: A R09 Set No. 2

Decade Counters Mod-5 counter: Decade Counter:

ELCT201: DIGITAL LOGIC DESIGN

Synchronous Sequential Logic. Chapter 5

Introduction to Digital Logic Missouri S&T University CPE 2210 Exam 2 Logistics

MODEL QUESTIONS WITH ANSWERS THIRD SEMESTER B.TECH DEGREE EXAMINATION DECEMBER CS 203: Switching Theory and Logic Design. Time: 3 Hrs Marks: 100

A.R. ENGINEERING COLLEGE, VILLUPURAM ECE DEPARTMENT

The reduction in the number of flip-flops in a sequential circuit is referred to as the state-reduction problem.

D U I S B U R G E S S E N

Logic Design II (17.342) Spring Lecture Outline

Vignana Bharathi Institute of Technology UNIT 4 DLD

RS flip-flop using NOR gate

Sequential Digital Design. Laboratory Manual. Experiment #3. Flip Flop Storage Elements

CS T34-DIGITAL SYSTEM DESIGN Y2/S3

Chapter 6. Flip-Flops and Simple Flip-Flop Applications

DIGITAL ELECTRONICS: LOGIC AND CLOCKS

Laboratory Objectives and outcomes for Digital Design Lab

Transcription:

Magyar Kutatók 7. Nemzetközi Szimpóziuma 7 th International Symposium of Hungarian Researchers on Computational Intelligence A New General Class of Fuzzy Flip-Flop Based on Türkşen s Interval Valued Fuzzy Sets Rita Lovassy Institute of Microelectronics and Technology, Kandó Kálmán Faculty of Electrical Engineering, Budapest Tech, Hungary lovassy.rita@kvk.bmf.hu László T. Kóczy Institute of Information Technology, Mechanical and Electrical Engineering, Faculty of Engineering Sciences, Széchenyi István University, Győr, Hungary Department of Telecommunication and Media Informatics, Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics, Hungary koczy@sze.hu, koczy@tmit.bme.hu Abstract: The extension of binary J-K flip-flops to fuzzy generalizations (F 3 ) was proposed originally by Hirota and Ozawa. They introduced the concept of reset type and set type F 3. Several alternative F 3 -s were later proposed, such as algebraic, symmetrical set-reset type and non-associative connective based F 3 -s, as well. This paper continues the investigation of the possible range of fuzzy flip-flops by examining the IVFS expression given by Türkşen and its midpoint values, and also by introducing the minimized IVFS (MIVFS), more fitting Hirota s original definitions, and the midpoint of MIVFS. This way a set of new definitions of F 3 -s are obtained with diverse behavior. The standard and algebraic F 3 -s based on these new definitions are graphically examined and briefly analyzed. Keywords: Fuzzy logic, J-K flip-flop, DNF, CNF, IVFS, MIVFS 1 Introduction In 1965 L. A. Zadeh [11] proposed fuzzy set theory. Since then, fuzzy sets, logics, and systems theory have gone through many theoretical developments and its applications to real life problems have been demonstrated with many applications. Examples of such successful applications can be categorized under two main headings: 121

R. Lovassy et al. A New General Class of Fuzzy Flip-Flop Based on Türkşen s Interval Valued Fuzzy Sets (1) Mathematical developments in set and logic theories. (2) Real life applications in control technology, robotics, and decision support systems. As a possible starting point for practical applicable systems, but also undoubtedly as part of the further development of the basics of fuzzy logic, Hirota and Ozawa [7] introduced the notion of the fuzzy J-K flip-flop, considering it an essential and basic component for effective processing of fuzzy information. They introduced two types of fundamental characteristic equations of fuzzy flipflops (F 3 ). They are the so called reset type and set type equations, both of which are fuzzy extensions of the characteristic equation of J-K flip-flop. Fuzzy negation, t-norm and s-norm (t-conorm) operations were used to establish the reset and set type fuzzy flip-flop. Both the reset and set type equations might be expressed e.g. by complementation, min and max operations (standard F 3 ), or complementation, algebraic product and sum operations (algebraic F 3 ). While the above cited authors proposed standard operations, the algebraic fuzzy flip-flop was introduced later, when Ozawa, Hirota and Kóczy [6] analyzed this new type of F 3 as an example of the general F 3 concept, which has been also defined as an extension of the binary flip-flop. 2 Binary (Boolean) and Fuzzy Flip-Flops 2.1 A Binary Logic J-K Flip-Flop All types of traditional binary flip-flop circuits, such as the most general J-K flipflop store a single bit of information. These elementary circuits are also the basic components of every synchronous sequential digital circuit. The next state Q t+ 1 of a J-K flip-flop is characterized as a function of both the present ( ) state Q() t and the two present inputs J ( t) and K ( t) be used instead of J () t, K () t and Q ( t). In the next, J, K and Q will, respectively, as simplified notations. The minterm expression (disjunctive normal form - DNF) of Q( t+ 1) can be written as Qt ( + 1) = JKQ+ JKQ+ JKQ+ JKQ, (1) this can be simplified to the minimal disjunctive form Qt ( + 1) = JQ+ KQ (2) 122

Magyar Kutatók 7. Nemzetközi Szimpóziuma 7 th International Symposium of Hungarian Researchers on Computational Intelligence This latter is well-known as the characteristic equation of J-K flip-flops. On the other hand, the equivalent maxterm expression (conjunctive normal form - CNF) can be given by ( )( ) Q( t+ 1) = ( J + K + Q)( J + K + Q) J + K + Q J + K + Q, (3) in a similar way the minimized conjunctive form can be given by Qt ( + 1) = ( J+ Q)( K+ Q). (4) These four expressions, (1), (2), (3) and (4), are equivalent in Boolean logic, however there exist no such fuzzy operation triplets where these two forms are necessarily equivalent. It is a rather obvious question, which of these four, or any other equivalent, should be considered as the most proper fuzzy extension of the definitive equation of the very fundamental concept of fuzzy J-K flip-flop. There is no justifiable argumentation that prefers any of these four to the other. Thus, there is no unambiguous way to introduce the concept of fuzzy J-K flip-flop. While normal forms are especially important for theoretical reasons both minimal forms are equally important in the practice. This is why Hirota and Ozawa [2, 3] proposed two dual definitions of fuzzy flip-flops. They interpreted (2) as the definition for what they called reset type fuzzy flip-flop : Q ( 1) ( ) ( ) R t+ = J Q K Q, (5) where the denotations for logic operations stand this time for Zadeh type fuzzy conjunction, disjunction and negation. In a similar way the definition of set type fuzzy flip-flop was obtained by re-interpreting (4) with fuzzy operations: Q ( t+ 1) = ( J Q) ( K Q). (6) S As a mater of course, it is possible to substitute the Zadeh operations by any other reasonable fuzzy operation triplet (e.g. De Morgan triplet), this way obtaining a multitude of various fuzzy flip-flop (F 3 ) pairs, such as the algebraic F 3 introduced in [6] and [7]. 2.2 Standard (min-max) J-K Flip-Flop Schweizer and Sklar [8] state that there is a one-to-one correspondence between t- norms and their dual t-conorms. Most definitions of F 3 s in the literature use such corresponding pairs. Often they also form a De Morgan triplet with standard complementation. Supposing that standard complementation (7), conjunction (8), and disjunction (9) are selected as fuzzy negation, t-norm, and s-norm. A,B 01,, For [ ] Complementation A = 1 A, (7) 123

R. Lovassy et al. A New General Class of Fuzzy Flip-Flop Based on Türkşen s Interval Valued Fuzzy Sets Logical product A B min ( A, B) Logical sum A B max ( A, B) The expressions (5) and (6) are re-written as follows: R ( ) =, (8) =. (9) Q ( t+ 1) = max(min J,1 Q,min(1 K, Q)) and (10) Q ( t+ 1) = min(max( J, Q), max(1 K,1 Q)). (11) S The fuzzy flip-flop characterized by (10) is thus called a standard or min-max reset type F 3, and the one given by (11) a standard or min-max set type F 3. 2.3 Algebraic J-K Flip-Flop In case of another special conjugate pair of t-norm and s-norm with the complementation (12), namely the algebraic product (13) and algebraic sum (14) we obtain Complementation A = 1 A, (12) Algebraic product A B = AB, (13) Algebraic sum A + B = A+ B AB. (14) Replacing and, or, and not by these three operations the expressions for the two corresponding F 3 -s the following two equations are obtained: Q ( 1) 2 R t J Q JQ KQ JQ JQK JKQ 2 2 + = + + + and (15) Q ( t 1) J Q JQ JKQ KQ JKQ S 2 2 + = + +. (16) The fuzzy flip-flop characterized by (15) is called algebraic reset type F 3, and the one given by (16) algebraic set type F 3. The main problem with this approach is that different representations of the original logical operation lead to different results - even if we use the simplest possible operations. 3 The DNF-CNF Interval DNF and CNF play very special roles in classical Boolean logic. They represent those standard forms, which do not contain any redundancy in the sense that they cannot be further reduced by applying the idempotence law, however they consist of complete members containing all variables in question, thus usually they can be 124

Magyar Kutatók 7. Nemzetközi Szimpóziuma 7 th International Symposium of Hungarian Researchers on Computational Intelligence simplified by merging and eliminating - this way obtaining the corresponding minimal forms. In fuzzy logic there are no standard forms in this sense as idempotence itself does usually not hold. Any repeated member would change the value of the expression. Despite this latter fact several authors consider the fuzzy extensions of DNF and CNF as having special significance. Especially, Türkşen [10] examined the special properties of the extended normal forms and came to the somewhat surprising and very convenient conclusion that in fuzzy logic the equivalents of the CNF and DNF forms represent the extremes of all possible expressions that correspond to forms being equivalent in binary logic. Thus he showed that for any fuzzy connective the value of every other form lies in the interval formed by the CNF and DNF values. In [9], this result was proven for logical operations with an arbitrary number of variables. 3.1 Interval Valued Fuzzy Sets While the theory of the interval valued fuzzy sets (IVFS) is much more general and can be considered as a special case of L-fuzzy sets [1] Türkşen proposed the interval determined by the disjunctive and conjunctive normal forms as the interval associated with the value belonging to an expression obtained by the fuzzy extension of some classic binary concept. Indeed, any theoretically possible formulation of the same concept would result in a value lying within the interval thus proposed. According to Türkşen s statement the DNF is always included in the corresponding CNF, i.e., DNF ( ) CNF ( ) where ( ) represents a particular expression [9]. The fundamental result that every DNF is contained in its corresponding CNF is true for min-max operators and for algebraic triplets as well. Türkşen [9] proposed to define the interval-valued fuzzy set representing a Boolean expression as follows: () = () () IVFS DNF,CNF (17) 3.2 Fuzzy Flip-Flops based on Türkşen s IVFS The DNF and CNF forms for J-K flip-flops are expressed in 2.1. By applying the usual denotations for fuzzy negation, t-norm and t-conorm, (1) is re-written as follows DNF ( 1) (( 1 ) ( 1 ) ) ( ( 1 ) ( 1 )) ( ( 1 ) ) ( J K ( 1 Q )), Q t+ = J K Q J K Q J K Q (18) 125

R. Lovassy et al. A New General Class of Fuzzy Flip-Flop Based on Türkşen s Interval Valued Fuzzy Sets further, in the same way, (3) becomes CNF ( 1) ( ) ( ( 1 ) ) ( ( 1 ) ( 1 )) Q t+ = J K Q J K Q J K Q (( 1 ) ( 1 ) ( 1 )) J K Q. (19) This way we obtained two more definitions of min-max fuzzy flip-flops. It is questionable, of course, whether these new definitions play any more important role in the practice than the previous set type and reset type equations. These latter ones may be called normalized reset type and set type F 3 -s. Using the algebraic operations, a similar pair of normalized flip-flops may be obtained. Here we omitted the explicit formulas as it is rather easy to determine them but they are somewhat lengthy. Although the examination of these new F 3 -s may be interesting itself, in this paper we go another way. Reset and set type behaviors are generally different and none of them possess the nice symmetrical behavior of the original J-K flip-flop. This is why a symmetrical F 3 was proposed earlier by combining the two minimal forms in the equilibrium point [6]. Only one exceptional combination of operations has been found as far where the two types completely coincided [5]. Another possibility to combine two different extensions of the original definition is to choose a representative point of each interval corresponding to the IVFS obtained from the two normal forms. As the most obvious representative, the midpoint is proposed here. Figure 1 depicts the DNF and CNF flip-flops and the graphs belonging to the midpoints of the intervals delimited by them. The 25 small graphs present the behavior of the F 3 for different combinations of J and K (in steps of 0.25 from 0 to 1). Because, however, in all earlier publications it was the minterm and maxterm expressions that played important roles rather then the normal forms we propose here a new interval the one limited by the minterm and the maxterm: () = () ( ) MIVFS DMF,CMF (20) MIVFS is the narrower interval given by the inequality DNF () DMF () CMF ( ) CNF ( ). The Figure shows the graphs corresponding to MIVFS, as well. In order to obtain a single fuzzy flip-flop we propose that the midpoint of MIVFS is considered as the definition of the new type standard F 3. Figure 2 presents the six graphs corresponding to DNF, DMF, CMF, CNF, further (DNF+CNF)/2 and (DMF+CMF)/2 for algebraic F 3 -s. Studying the behavior of the min-max J-K flip-flop, we remark that in the case of J = K, the values of the next state Q (t+1) are equal in every 6 focused case. If Q 126

Magyar Kutatók 7. Nemzetközi Szimpóziuma 7 th International Symposium of Hungarian Researchers on Computational Intelligence (t) = 0, the starting values of the piecewise linear characteristics are equal to the value of J. If Q (t) = 1 the endpoint values, for all 6 graphs are identical with the negated values of K. If we draw an imaginary diagonal line, it is easy to observe, that the diagrams are symmetrical. In these mentioned cases the values of J and K are complementary. The characteristics belonging to the intermediate cases show the obvious situation, when the reset type curves always go below the set type ones. In these cases the graphs belonging to the DNF and CNF values represent the extreme cases. This, so called Türkşen interval is the largest when J = 1,K = 0, and vice versa. The characteristics representing the (DNF+CNF)/2 and (DMF+CMF)/2 curves are naturally in the middle. Comparing the behavior of the algebraic J-K flip-flop (Figure 2), with the standard one, we came to the result, that the algebraic operations produced smooth (differentiable) curves and surfaces with no breakpoints or lines at all. The border characteristics of the Türkşen interval are in this case also the graphs corresponding to DNF and CNF. This interval represents a larger surface than in the case discussed first. It is clearly demonstrated that Türkşen s statement discussed in section 3.1 holds. Completely new is the fact that in case of J, K ( 0,1), the values of Q (t+1) for different values of Q( t) [ 0,1], are not equal. The appearance of this interval in the real fuzzy cases for J and K introduces a new concept, a truly interval valued fuzzy flip-flop. Generally, it may be remarked, that MIVFS reflects the typical behavior of fuzzy flip-flop more obviously in both cases and closes around the average behavior in a narrower stripe, while the original IVFS opens up wider in the areas where real fuzziness occurs intensively. It remains an open question which of the two new average types F 3 -s will be more applicable for practical purposes. Conclusions In this paper, interval valued fuzzy sets are defined as an extension of the disjunctive and conjunctive normal forms in Boolean logic. Such IVFS s exist for some cases of certain families of the conjugate pairs of t-norms and t-conorms. Considering that the flip-flop thus defined is described by an opening pair of graphs, we suggested that the midpoint of the border values of the intervals be considered as the definitive function for this new type of (point valued) F 3. In the future we intend to investigate the behavior of complex fuzzy sequential circuits based on interval valued F 3. It would be very interesting to examine the behavior of such fuzzy networks, to determine the possible divergence behavior and to find the proper, ideal functional interval, or point. Acknowledgements This research was partially supported by the National Scientific Research Fund Grants no. T048832 and T043258, and a Széchenyi István University Main 127

R. Lovassy et al. A New General Class of Fuzzy Flip-Flop Based on Türkşen s Interval Valued Fuzzy Sets Research Direction Grant, further Budapest Tech and the Kandó Kálmán Faculty of Electrical Engineering also contributed to this study. References [1] Goguen, J. A.: L-Fuzzy Sets, J. of Math. Analysis ands Applications, 18, pp. 145-174 [2] K. Hirota, K. Ozawa: Concept of Fuzzy Flip-Flop, Preprints of 2 nd IFSA Congress, Tokyo, 1987, pp. 556-559 [3] K. Hirota, K. Ozawa: Fuzzy Flip-Flop as a Basis of Fuzzy Memory Modules, In: M. M. Gupta et al., eds., Fuzzy Computing. Theory, Hardware and Applications, North Holland, Amsterdam, 1988, pp. 173-183 [4] G. J. Klir, T. A. Folger: Fuzzy Sets, Uncertainty, and Information, Prentice Hall, Upper Saddle River, NJ, 1988, pp. 37-63 [5] R. Lovassy, L. T. Kóczy: Non-Associative Fuzzy Flip-Flop with Dual Set- Reset Feature, 4 th Serbian-Hungarian Joint Symposium on Intelligent Systems, Subotica, 2006, pp. 289-299 [6] K. Ozawa, K. Hirota, L. T. Kóczy, K. Ohmori: Algebraic Fuzzy Flip-Flop Circuits, Fuzzy Sets and Systems 39/2, 1991, pp. 215-226 [7] K. Ozawa, K. Hirota, L. T. Kóczy: Fuzzy Flip-Flop, In: M. J. Patyra, D. M. Mlynek, eds., Fuzzy Logic. Implementation and Applications, Wiley, Chichester, 1996, pp. 197-236 [8] B. Schweizer, A. Sklar: Associative Functions and Statistical Triangle Inequalities, Publ. Math. 8 Debrecen, 1961, pp. 169-186 [9] I. B. Türkşen: Interval-valued Fuzzy Sets Based on Normal Forms, Fuzzy Sets and Systems 20, 1986, pp. 191-210 [10] I. B. Türkşen, A. Esper, K. Patel, S. A. Starks, V. Kreinovich: Selecting a Fuzzy Logic Operation from the DNF-CNF Interval: How Practical Are the Resulting Operations?, Proceedings of the 21 st International Conference of the North American Fuzzy Information Processing Society NAFIPS 2002, New Orleans, 2002, pp. 28-33 [11] L. A. Zadeh: Fuzzy Sets, Information and Control 8, 1965, pp. 338-353 128

Magyar Kutatók 7. Nemzetközi Szimpóziuma 7 th International Symposium of Hungarian Researchers on Computational Intelligence Figure 1 Characteristics of min-max type fuzzy flip-flops for various values of K 129

R. Lovassy et al. A New General Class of Fuzzy Flip-Flop Based on Türkşen s Interval Valued Fuzzy Sets Figure 2 Characteristics of algebraic type fuzzy flip-flops for various values of K 130