Finite Switchboard State Machines Based on Cubic Sets

Naveed Yaqoob and Nabilah Abughazalah

Complexity, 2019, vol. 2019, 1-13

Abstract:

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.

Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2019/2548735.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2019/2548735.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:2548735

DOI: 10.1155/2019/2548735

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().