Some Improvements in the Construction of Fuzzy Automata

dc.contributor.guideJiwari, Ram
dc.coverage.spatial
dc.creator.researcherGarhwal, Sunita
dc.date.accessioned2021-05-13T06:56:11Z
dc.date.available2021-05-13T06:56:11Z
dc.date.awarded
dc.date.completed2017
dc.date.registered
dc.description.abstractRegular expression is a mathematical representation of regular language. There are many recent developments in Science, Engineering, and Mathematics in the previous century. In formal languages, string is either totally accepted or rejected, whereas in case of fuzzy languages, the string is not totally accepted or rejected, rather it belongs to the language with some degree of membership. One of the main concerns related to these developments is uncertainty. For handling uncertainty and reducing the gap between natural and programming language, the concept of fuzzy languages have been introduced as an extension of formal languages. Fuzzy automata are generalization of the classical automata, closing the gap between classical automata theory and natural languages. Fuzzy regular expressions and fuzzy automata have received significant attention due to their practical applications in various fields, such as databases, pattern recognition, control systems, discrete event systems, clinical monitoring, computing with words, learning systems, and descriptions of natural and programming languages. The main aim of this dissertation is to propose some improvements in the construction of fuzzy automata. The inclusion of shuffle operators in the regular expression is known as a parallel regular expression. Motivated by the applications of fuzzy automata and parallel regular expressions, we have proposed a new mathematical model that involves fuzziness in parallel finite automata. In this thesis, an algorithm is proposed for the conversion of parallel fuzzy regular expressions to and#949;-free fuzzy automata. Motivated by the existing literature for the transformation of finite automata to regular expression using approaches such as Arden s Theorem, Transitive closure, Brzozowski algebraic and State removal, in this thesis, an algorithm is proposed for the conversion of a fuzzy automaton into a fuzzy regular expression by extending the well-known concept of the Transitive closure methods.
dc.description.note
dc.format.accompanyingmaterialNone
dc.format.dimensions
dc.format.extent89p.
dc.identifier.urihttp://hdl.handle.net/10603/326261
dc.languageEnglish
dc.publisher.institutionDepartment of Computer Science and Engineering
dc.publisher.placePatiala
dc.publisher.universityThapar Institute of Engineering and Technology
dc.relation
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordFuzzy automata
dc.subject.keywordFuzzy linear expressions
dc.subject.keywordFuzzy regular expression
dc.titleSome Improvements in the Construction of Fuzzy Automata
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 18
Loading...
Thumbnail Image
Name:
01_title.pdf
Size:
333.89 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
02_dedication.pdf
Size:
166.29 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
03_certificate.pdf
Size:
232.79 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
04_acknoeledgement.pdf
Size:
561.79 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
05_abstract.pdf
Size:
358.01 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: