A Study Of Frames In The Fuzzy And Intuitionist Fuzzy Contexts

The fuzzy set theory has a wider scope of applicability than classical set theory in solving various problems. Fuzzy set theory in the last three decades as a formal theory which got formalized by generalizing the original ideas and concepts in classical mathematical areas and as a very powerful modeling language, that can cope with a large fraction of uncertainties of real life situations. In Intuitionistic Fuzzy sets a new component degree of non membership in addition to the degree of membership in the case of fuzzy sets with the requirement that their sum be less than or equal to one. The main objective of this thesis is to study frames in Fuzzy and Intuitionistic Fuzzy contexts. The thesis proved some results such as ifµ is a fuzzy subset of a frame F, then µ is a fuzzy frame of F iff each non-empty level subset µt of µ is a subframe of F, the category Fuzzfrm of fuzzy frames has products and the category Fuzzfrm of fuzzy frames is complete. It define a fuzzy-quotient frame of F to be a fuzzy partition of F, that is, a subset of IF and having a frame structure with respect to new operations and study the notion of intuitionistic fuzzy frames and obtain some results and introduce the concept of Intuitionistic fuzzy Quotient frames. Finally it establish the categorical link between frames and intuitionistic fuzzy topologies.

Box Products in Fuzzy Topological Spaces and Related Topics

The topology as the product set with a base chosen as all products of open sets in the individual spaces. This topology is known as box topology. The main objective of this study is to extend the concept of box products to fuzzy box products and to obtain some results regarding them. Owing to the fact that box products have plenty of applications in uniform and covering properties, here made an attempt to explore some inter relations of fuzzy uniform properties and fuzzy covering properties in fuzzy box products. Even though the main focus is on fuzzy box products, some brief sketches regarding hereditarily fuzzy normal spaces and fuzzy nabla product is also provided. The main results obtained include characterization of fuzzy Hausdroffness and fuzzy regularity of box products of fuzzy topological spaces. The investigation of the completeness of fuzzy uniformities in fuzzy box products proved that a fuzzy box product of spaces is fuzzy topologically complete if each co-ordinate space is fuzzy topologically complete. The thesis also prove that the fuzzy box product of a family of fuzzy α-paracompact spaces is fuzzy topologically complete. In Fuzzy box product of hereditarily fuzzy normal spaces, the main result obtained is that if a fuzzy box product of spaces is hereditarily fuzzy normal ,then every countable subset of it is fuzzy closed. It also deals with the notion of fuzzy nabla product of spaces which is a quotient of fuzzy box product. Here the study deals the relation connecting fuzzy box product and fuzzy nabla product

Study on Fuzzy Ordered FuzzyTopological Spaces

In this study we combine the notions of fuzzy order and fuzzy topology of Chang and define fuzzy ordered fuzzy topological space. Its various properties are analysed. Product, quotient, union and intersection of fuzzy orders are introduced. Besides, fuzzy order preserving maps and various fuzzy completeness are investigated. Finally an attempt is made to study the notion of generalized fuzzy ordered fuzzy topological space by considering fuzzy order defined on a fuzzy subset.

Median Sets and Median Number of a Graph

A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which minimises the sum of the distances to the vertices of the profile is the median of the profile. Any subset of the vertex set such that it is the median of some profile is called a median set. The number of median sets of a graph is defined to be the median number of the graph. In this paper, we identify the median sets of various classes of graphs such as Kp − e, Kp,q forP > 2, and wheel graph and so forth. The median numbers of these graphs and hypercubes are found out, and an upper bound for the median number of even cycles is established.We also express the median number of a product graph in terms of the median number of their factors.

Mathematical Morphology on Hypergraphs Using Vertex-Hyperedge Correspondence

The focus of this paper is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of dual adjunctions between the vertex set and the hyperedge set of a hypergraph , by defining a vertex-hyperedge correspondence. This allows us to recover the classical notion of a dilation/erosion of a subset of vertices and to extend it to subhypergraphs of . This paper also studies the concept of morphological adjunction on hypergraphs for which both the input and the output are hypergraphs

Morphological filtering on hypergraphs

The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of dual adjunctions between the vertex set and the hyper edge set of a hypergraph H, by defining a vertex-hyperedge correspondence. This allows us to recover the classical notion of a dilation/erosion of a subset of vertices and to extend it to subhypergraphs of H. Afterward, we propose several new openings, closings, granulometries and alternate sequential filters acting (i) on the subsets of the vertex and hyperedge set of H and (ii) on the subhypergraphs of a hypergraph

A study on semigroup action on fuzzy subsets, inverse fuzzy automata and related topics

This thesis comprises five chapters including the introductory chapter. This includes a brief introduction and basic definitions of fuzzy set theory and its applications, semigroup action on sets, finite semigroup theory, its application in automata theory along with references which are used in this thesis. In the second chapter we defined an S-fuzzy subset of X with the extension of the notion of semigroup action of S on X to semigroup action of S on to a fuzzy subset of X using Zadeh's maximal extension principal and proved some results based on this. We also defined an S-fuzzy morphism between two S-fuzzy subsets of X and they together form a category S FSETX. Some general properties and special objects in this category are studied and finally proved that S SET and S FSET are categorically equivalent. Further we tried to generalize this concept to the action of a fuzzy semigroup on fuzzy subsets. As an application, using the above idea, we convert a _nite state automaton to a finite fuzzy state automaton. A classical automata determine whether a word is accepted by the automaton where as a _nite fuzzy state automaton determine the degree of acceptance of the word by the automaton. 1.5. Summary of the Thesis 17 In the third chapter we de_ne regular and inverse fuzzy automata, its construction, and prove that the corresponding transition monoids are regular and inverse monoids respectively. The languages accepted by an inverse fuzzy automata is an inverse fuzzy language and we give a characterization of an inverse fuzzy language. We study some of its algebraic properties and prove that the collection IFL on an alphabet does not form a variety since it is not closed under inverse homomorphic images. We also prove some results based on the fact that a semigroup is inverse if and only if idempotents commute and every L-class or R-class contains a unique idempotent. Fourth chapter includes a study of the structure of the automorphism group of a deterministic faithful inverse fuzzy automaton and prove that it is equal to a subgroup of the inverse monoid of all one-one partial fuzzy transformations on the state set. In the fifth chapter we define min-weighted and max-weighted power automata study some of its algebraic properties and prove that a fuzzy automaton and the fuzzy power automata associated with it have the same transition monoids. The thesis ends with a conclusion of the work done and the scope of further study.