Fuzzy finite switchboard automata with complete residuated lattices
The theory of fuzzy finite switchboard automata (FFSA) is introduced by the use of general algebraic structures such as complete residuated lattices in order to enhance the process ability of FFSA. We established the notion of homomorphism, strong homomorphism and reverse homomorphism and shows some...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
Science Publishing Corporation
2018
|
| Subjects: | |
| Online Access: | http://eprints.uthm.edu.my/4081/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The theory of fuzzy finite switchboard automata (FFSA) is introduced by the use of general algebraic structures such as complete residuated lattices in order to enhance the process ability of FFSA. We established the notion of homomorphism, strong homomorphism and reverse homomorphism and shows some of its properties. The subsystem of FFSA is studied and the set of switchboard subsystemforms a complete ℒ -sublattices is shown. The algorithm of FFSA with complete residuated lattices is given and an example is provided. |
|---|