A finite switchboard state machine is a specialized finite state machine. The algebraic approach of finite switchboard state machine is still lacking in literature. In this paper, we applied the algebraic approach of finite switchboard state machine and study its related properties. Real life examples of the applications are given by discussing the algebraic properties used
AbstractGeneral algebraic structures are introduced and used to develop representations for discrete...
This book presents a complete and accurate study of algebraic circuits, digital circuits whose perfo...
Finite memory finite-state machines have received considerable attention recently for at least two r...
A finite switchboard state machine is a specialized finite state machine. It is built by binding the...
The constructions of finite switchboard state automata are known to be an extension of finite automa...
AbstractWe show that finite-state machines can be represented as unique elements of special modules ...
AbstractSpecial algebraic structures, which are rings of functions with finite support, are introduc...
The constructions of finite switchboard state automata is known to be an extension of finite automat...
The Algebraic Theory of Switching Circuits covers the application of various algebraic tools to the ...
In this paper the notion of a N-finite state machine is introduced, as well as the concepts of a N-...
The constructions of finite switchboard state automata is known to be an extension of finite automat...
In this paper we introduced the concept of interval neutrosophic finite state machine, interval neut...
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
This dissertation advances a novel approach to formal specification and verification of systems-leve...
Using single valued neutrosophic set we introduced the notion of single valued neutrosophic finite s...
AbstractGeneral algebraic structures are introduced and used to develop representations for discrete...
This book presents a complete and accurate study of algebraic circuits, digital circuits whose perfo...
Finite memory finite-state machines have received considerable attention recently for at least two r...
A finite switchboard state machine is a specialized finite state machine. It is built by binding the...
The constructions of finite switchboard state automata are known to be an extension of finite automa...
AbstractWe show that finite-state machines can be represented as unique elements of special modules ...
AbstractSpecial algebraic structures, which are rings of functions with finite support, are introduc...
The constructions of finite switchboard state automata is known to be an extension of finite automat...
The Algebraic Theory of Switching Circuits covers the application of various algebraic tools to the ...
In this paper the notion of a N-finite state machine is introduced, as well as the concepts of a N-...
The constructions of finite switchboard state automata is known to be an extension of finite automat...
In this paper we introduced the concept of interval neutrosophic finite state machine, interval neut...
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
This dissertation advances a novel approach to formal specification and verification of systems-leve...
Using single valued neutrosophic set we introduced the notion of single valued neutrosophic finite s...
AbstractGeneral algebraic structures are introduced and used to develop representations for discrete...
This book presents a complete and accurate study of algebraic circuits, digital circuits whose perfo...
Finite memory finite-state machines have received considerable attention recently for at least two r...