THE FINITE AUTOMATION-FINITE STATE SYSTEMS
The finite automation is a
mathematical model of a system, with
discrete inputs and outputs. The system can in any one of a finite number of internal configuration or states. The state of the system summaries the information concerning past inputs that is needed to determine the behaviour of the system on subsequent inputs.
A Finite automation consists of a finite set of states and set of transitions from state of state that occur on input symbols chosen from an alphabet Sigma. For each input symbol there is exactly one
transition out of each state. One state usually denoted q0, is the initial state, in which the automation starts. Some states are designed as final or accepting states.
Always associated with a FA is a transition diagram which is noting but a directed
graph. The vertices of the graph correspond to the states of the FA. If there is a transmission from state q to state p on input a, then there is an arc labelled a from state q to p in the transition diagram. The FA accepts a string of symbols from Sigma, x if the sequence of transition corresponding to symbols in x leads from the state to an accepting state.
Published: September 09, 2007
More reviews about the http://hvtechnology.blogspot.com