A state machine can be defined, so elemental, like a digital device capable of being pierced by a predetermined sequence of states in an orderly manner so that the value of its output at a given instant, it depends on the states logic inputs, but the sequence in which these statements are applied to the inputs.
In a sequential circuit are:
* 'n' input variables. -> 2n input states.
* 'm' memory variables. -> 2m internal states.
* 'p' output variables. -> 2p output states.
In practice, the state machines are known as finite automata.
REPRESENTATION OF AUTOMATA
The two basic realizations of finite automata are Mealy machines and Moore, which in turn can be synchronous or asynchronous.
To represent the behavior of sequential circuits are used:
Tables or tables of transition states (in a format similar to truth tables.)
Graphs (also known as state diagrams), which shows the different states (which are finite) and the transition functions of the outputs for each combination of inputs (which are also finite).
These tables and graphs differ depending on whether it is an automaton or machine Mealy or Moore.
Mealy AUTOMATON
In a Mealy machine, the outputs can change if you change the inputs and without need to produce a pulse in the block of records.
GRAPH (Flowcharts)
In this type of representation the states are shown within circles. The transition between states are indicated by arcs that connect two states and these arcs indicates the input that causes the transition and output for that input and the current status.
MOORE AUTOMATIC
Moore machine is a special case of Mealy machine, which outputs only depend on the internal state and no entries.
Therefore, in a Moore machine, if any input change, the outputs remain unchanged at least until you see a clock pulse that results in a change in the internal states (memory elements). An example of a Moore machine is a counter.
GRAPH (Flowcharts)
In this type of representation of states and current outputs are shown within circles. The transition between states are indicated by arcs that connect two states and these arcs indicates the input that causes the transition.
In a sequential circuit are:
* 'n' input variables. -> 2n input states.
* 'm' memory variables. -> 2m internal states.
* 'p' output variables. -> 2p output states.
In practice, the state machines are known as finite automata.
REPRESENTATION OF AUTOMATA
The two basic realizations of finite automata are Mealy machines and Moore, which in turn can be synchronous or asynchronous.
To represent the behavior of sequential circuits are used:
Tables or tables of transition states (in a format similar to truth tables.)
Graphs (also known as state diagrams), which shows the different states (which are finite) and the transition functions of the outputs for each combination of inputs (which are also finite).
These tables and graphs differ depending on whether it is an automaton or machine Mealy or Moore.
Mealy AUTOMATON
In a Mealy machine, the outputs can change if you change the inputs and without need to produce a pulse in the block of records.
GRAPH (Flowcharts)
In this type of representation the states are shown within circles. The transition between states are indicated by arcs that connect two states and these arcs indicates the input that causes the transition and output for that input and the current status.
MOORE AUTOMATIC
Moore machine is a special case of Mealy machine, which outputs only depend on the internal state and no entries.
Therefore, in a Moore machine, if any input change, the outputs remain unchanged at least until you see a clock pulse that results in a change in the internal states (memory elements). An example of a Moore machine is a counter.
GRAPH (Flowcharts)
In this type of representation of states and current outputs are shown within circles. The transition between states are indicated by arcs that connect two states and these arcs indicates the input that causes the transition.
No hay comentarios:
Publicar un comentario