Finite Switchboard State Machines Based on Cubic Sets

We study the cubic finite switchboard state machines (cubic fssms) intensively. The notions of (resp., good, strong) subsystem of cubic fssm are introduced. We prove that the Cartesian composition of two (resp., good, strong) subsystems of cubic fssms is (resp., good, strong) subsystem of cubic fssm...

Full description

Saved in:
Bibliographic Details
Main Authors: Naveed Yaqoob, Nabilah Abughazalah
Format: Article
Language:English
Published: Wiley 2019-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2019/2548735
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study the cubic finite switchboard state machines (cubic fssms) intensively. The notions of (resp., good, strong) subsystem of cubic fssm are introduced. We prove that the Cartesian composition of two (resp., good, strong) subsystems of cubic fssms is (resp., good, strong) subsystem of cubic fssm. Similarly, the product of two (resp., good, strong) subsystems of cubic fssms is (resp. good, strong) subsystem of cubic fssm. We define the homomorphism between two of cubic fssms and proved some related results. Many examples on each case are provided.
ISSN:1076-2787
1099-0526