Finite-State Machines - Research Article from World of Computer Science

This encyclopedia article consists of approximately 3 pages of information about Finite-State Machines.

Finite-State Machines - Research Article from World of Computer Science

This encyclopedia article consists of approximately 3 pages of information about Finite-State Machines.
This section contains 834 words
(approx. 3 pages at 300 words per page)
Buy the Finite-State Machines Encyclopedia Article

In many instances, it is of no interest to us how a particular machine is actually constructed--that is, we do not care whether a machine is made of silicon chips, wire, and steel, or whether it is constructed from tin cans, string, and matchsticks. All we want to know is what the behavioral relationship of the machine is to its defined environment. Such an abstract definition of a machine is necessary for purposes of analyzing what type of machine can achieve what end, and also to avoid dealing with the complexity of implementation at the same time as the analysis of abstract design.

Properties that are common to all machines are the processing of input and the production of output. The input may take several forms--a vending machine takes coins, an ATM takes a card, and a numeric lock takes a number punched on a keypad...

(read more)

This section contains 834 words
(approx. 3 pages at 300 words per page)
Buy the Finite-State Machines Encyclopedia Article
Copyrights
Gale
Finite-State Machines from Gale. ©2005-2006 Thomson Gale, a part of the Thomson Corporation. All rights reserved.