Abstract
Quotient structures of intuitionistic fuzzy finite state machines are discussed. We give congruence relations which can be naturally introduced in such a way that each associates a semigroup with an intuitionistic fuzzy finite state machine. We also introduce the notion of intuitionistic admissible relation, and give its characterization. An isomorphism between an intuitionistic fuzzy finite state machine and the quotient structure of another intuitionistic fuzzy finite state machine is established.
Sign-in/Register to access full text options 
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.
