| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 396107 | Information Sciences | 2007 | 10 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Young Bae Jun,