Abstract
A two dimensional string is called a picture and is defined as a rectangular array of symbols taken from a finite alphabet. A two dimensional language or a picture language is a set of pictures. In this paper, a theoretical study is reported for two dimensional fuzzy regular languages generated by two dimensional fuzzy regular grammars and the two dimensional fuzzy finite state automata for the two dimensional fuzzy regular languages. We can construct the two dimensional fuzzy finite state automaton from the given two dimensional fuzzy regular grammar and vice versa. Further, we discuss some of the closure properties of two dimensional fuzzy regular languages with examples. We discuss the applications of two dimensional fuzzy regular language with respect to kolam patterns.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
