Restricted cascade and wreath products of fuzzy finite switchboard state machines

• Main Authors: Kavikumar, J., S. P., Tiwari, A. H., Nor Shamsidah, Sharan, S.
• Format: Article
• Language: English
• Published: University of Sistan and Baluchestan 2019
• Subjects: T Technology (General); QA76.75-76.765 Computer software
• Online Access: http://eprints.uthm.edu.my/5064/1/AJ%202020%20%2877%29.pdf; http://eprints.uthm.edu.my/5064/; https://dx.doi.org/ 10.22111/ijfs.2019.4485

A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of fuzzy finite switchboard state machines. More precisely, we study that the direct products/Cartesian compositions of two such fuzzy finite switchboard state machines is again a fuzzy finite switchboard state machine. In addition, we introduce the perfect switchboard machine and establish its Cartesian composition. The relations among the products also been examined. Finally, we introduce asynchronous fuzzy finite switchboard state machine and study the switching homomorphic image of asynchronous fuzzy finite switchboard state machine. We illustrate the definition of a restricted product of fuzzy finite switchboard state machine with the single pattern example.