Now showing items 1-2 of 2
| Abstract: | One can do research in pointfree topology in two ways. The rst is the contravariant way where research is done in the category Frm but the ultimate objective is to obtain results in Loc. The other way is the covariant way to carry out research in the category Loc itself directly. According to Johnstone [23], \frame theory is lattice theory applied to topology whereas locale theory is topology itself". The most part of this thesis is written according to the rst view. In this thesis, we make an attempt to study about 1. the frame counterparts of maximal compactness, minimal Hausdor - ness and reversibility, 2. the automorphism groups of a nite frame and its relation with the subgroups of the permutation group on the generator set of the frame |
| Description: | Department of Mathematics Cochin University of Science and Technology |
| URI: | http://dyuthi.cusat.ac.in/purl/4746 |
| Files | Size |
|---|---|
| Dyuthi-T1844.pdf | (460.2Kb) |
| Abstract: | 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. |
| URI: | http://dyuthi.cusat.ac.in/purl/4938 |
| Files | Size |
|---|---|
| Dyuthi-T2016.pdf.pdf | (648.9Kb) |
Now showing items 1-2 of 2
Dyuthi Digital Repository Copyright © 2007-2011 Cochin University of Science and Technology. Items in Dyuthi are protected by copyright, with all rights reserved, unless otherwise indicated.