Functional decomposition is to the process of expressing a function of n variables as a composition of a number of functions, each depending on less than n variables. If the function to be decomposed is a Boolean function, then the methods proposed by Ashenhurst and Curtis can be used. However, if the function is a fuzzy valued function, then a different method is necessary to decompose the function. / In this paper, after the basic definitions of fuzzy algebra are given, a brief review of the work in fuzzy switching logic is presented. The insufficiencies of Boolean methods and a previous method by Kandel for the decomposition of a fuzzy switching function are discussed. A new theorem for determining if a function possesses a fuzzy simple disjunctive decomposition is developed as well as a method for decomposing such a function. / Source: Dissertation Abstracts International, Volume: 42-03, Section: B, page: 1083. / Thesis (Ph.D.)--The Florida State University, 1981.
| Identifer | oai:union.ndltd.org:fsu.edu/oai:fsu.digital.flvc.org:fsu_74455 |
| Contributors | FRANCIONI, JOAN MARIE., Florida State University |
| Source Sets | Florida State University |
| Detected Language | English |
| Type | Text |
| Format | 66 p. |
| Rights | On campus use only. |
| Relation | Dissertation Abstracts International |
Page generated in 0.0794 seconds