Vous êtes sur la page 1sur 2

Automata is a model of a computer than is made from theories but doesnt really exist.

Think of an Automata as an imaginary computer.


In this imaginary computer called Automata, there are features.
One of these features is a mechanism that reads inputs.
We assume these inputs are strings made up of alphabets.
These inputs of strings are on an input file.
The Automata can read these inputs but cant change them.
The input file can be divide into cells which can only hold one symbol.
So the Automata mechanism reads the input file one symbol at a time from left to right.
The mechanism can tell when it is reaching the end of the input file.
So the Automata can produce an output.
The Automata also can have a temporary storage with an unlimited amount of cells that can store one
symbol at a time.
The Automata controls whats in the storage cell. So it can read and change the contents of the storage
cell.
The Automata has a control unit. This control unit can be found in any one of the finite internal states.
The control unit can change its states under certain conditions.
The Automata is supposed to operating within a certain time frame.
At any moment the control unit of the Automata can be in any internal state, while at the same time the
Automata mechanism is reading symbols from the input file.
When the control unit is going to change its internal state, the next state/transition functions
determines where it is going to go.
This is how the transition function works: The next internal state will receive the current internal state
input symbol from the transition function.
It will also receive any current data stored the in temporary storage.
The transition function sends all this info to the next internal state.
So when interval states are being change, sometimes an output is created on the information in the
temporary storage is changed.
Configuration is the current state of the control unit, input file, and temporary storage.
The changing of configurations are called a move.
Automata differs in how outputs can be created and the nature of the temporary storage.

The nature of the temporary storage controls the power of the automata.
There are two types of Automata:
Deterministic and Nondeterministic Automata.
Deterministic Automata moves are unique and can be predicted by internal state, input symbol, and
temporary storage.
Nondeterministic Automata have multiple moves so the next states can be more than one predictions.
An Automata output who is strictly yes or no is called an accepter.
The accepter either accepts a string or it doesnt
A transducer is an automata that can produce outputs that are strings of symbols group together.

Vous aimerez peut-être aussi