Professional Documents
Culture Documents
Lenguajes Formales
WHAT IS AN AUTOMATON?
An automaton is a mathematical model for a finite state machine, in which given an input of
symbols, it "jumps" through a series of states according to a transition function (which can be
expressed as a table). This transition function indicates which state to change given the current
state and the read symbol.
Example
Finite automaton that could be part of a lexical analyzer. The work of this automaton is to
recognize the word coding, so it needs seven states, each representing the position that has
been read in that word.
These positions correspond to the prefixes of the word, from the empty string (that is, when it
does not contain any characters) to the whole word.
TABLE OF TRANSITIONS
A table of transitions is a two-dimensional array (or matrix) whose elements provide the
summary of a corresponding transitions diagram.
The strings that must be analyzed in an application are constructed from a set of symbols. In any
situation we find that the set of symbols is finite, so our first step towards the formalization of
the recognition process is to assume the hypothesis of the existence of a finite, not empty, set of
symbols from which the chains are constructed that will be analyzed. We call this set of
symbols alphabet.
CONCLUSIONS:
- The table of transitions, analyzes the characters and transforms them into characters.
- A diagram of transition, localizes information about characters that are found at the time
of entry in a respective point of the table.
- A finite automaton is a computational model that performs automatically on an input to
produce an output.
- Regular languages are accepted as finite automata.
BIBLIOGRAPHY
api-developer. (15 de 02 de 2014). api-developer. Obtenido de api-developer:
https://www.api-developer.com