Design and validation of computer protocols
Design and validation of computer protocols
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
IEEE Spectrum
Automata, Languages, and Machines
Automata, Languages, and Machines
Logic Synthesis and Verification Algorithms
Logic Synthesis and Verification Algorithms
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Codes
| Hi-index | 0.00 |
A sequential machine is a mathematical model of a certain type of simple computational structure. If a sequential machine has a finite number of states, it is frequently called a finite-state machine, or FSM. Sequential machines have numerous applications, for example, in asynchronous circuits, coding theory, con- current systems, digital circuit design, formal language theory, hardware testing, protocol design, and software and hardware verification.