Abstract
This article introduces different congruence relations on the bipolar fuzzy set associated with the bipolar fuzzy finite state machine. Each congruence relation associates a semigroup with the bipolar fuzzy finite automata. We also discuss characterizing a bipolar fuzzy finite state machine by defining an admissible relation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 callMore From: International Journal of Analysis and Applications
Paper Title
Journal
Date
