Scribd
Upload
47 views3 pages

Ingeniería de Sistemas Lenguajes Formales

An automaton is a mathematical model of a finite state machine that "jumps" between states according to a transition function based on input symbols. There are two types of automata: deterministic finite automata where there is only one transition per state and input symbol, and non-deterministic finite automata which can have multiple transitions per state. Automata are used in applications like compilers, neural networks, and lexical analysis to recognize patterns and languages.

Uploaded by

Camilo Camilo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
47 views3 pages

Ingeniería de Sistemas Lenguajes Formales

An automaton is a mathematical model of a finite state machine that "jumps" between states according to a transition function based on input symbols. There are two types of automata: deterministic finite automata where there is only one transition per state and input symbol, and non-deterministic finite automata which can have multiple transitions per state. Automata are used in applications like compilers, neural networks, and lexical analysis to recognize patterns and languages.

Uploaded by

Camilo Camilo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Ingeniería de Sistemas

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.

FINITE DETERMINISTIC AUTOMATON


It is a finite automaton that is also a deterministic system; that is, for each state in which the
automaton is located, and with any symbol of the alphabet read, there is always no more than
one possible transition from that state and with that 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.

FINITE NON-DETERMINISTIC AUTOMATON


It is a finite automaton that, unlike finite deterministic automatons, has at least one state, in
which, for a symbol of the alphabet, there is more than one possible transition.
WHAT IS THE APPLICATION OF AN AUTOMATON
APPLICATION OF AUTOMATS TO COMPUTATIONAL LINGUISTICS COMPILER
A compiler is a computer program that translates a program written in a programming language
into another programming language, generating an equivalent program that the machine will be
able to interpret. Usually the second language is machine code, but it can also be simply text.
This translation process is known as compilation.
APPLICATION OF AUTOMATAS FOR THE DEVELOPMENT OF AN ARTIFICIAL
NEURONAL NETWORK
The networks of artificial neurons (usually referred to as RNA or in English as: "ANN") are a
paradigm of automatic learning and processing inspired by the way in which the nervous system
of animals works. It is a system of interconnection of neurons in a network that collaborates to
produce an exit stimulus. In artificial intelligence, it is common to refer to them as networks of
neurons or neural networks.
ELEMENTS OF A DETERMINISTIC FINITE AUTOMATON
Formally, it is defined as a 5-tuple (Q, Σ, q0, δ, F) where:

 Q {\displaystyle Q\,} Q\, it is a set of states;


 Σ {\displaystyle \Sigma \,} \Sigma \, it is an alphabet;
 q 0 ∈ Q {\displaystyle q_{0}\in Q} q_{0}\in Q it is the initial state;
 δ : Q × Σ → Q {\displaystyle \delta \colon Q\times \Sigma \to Q} \delta \colon Q\times
\Sigma \to Q it is a transition function;
 F ⊆ Q {\displaystyle F\subseteq Q} F\subseteq Q it is a set of final states or acceptance.
That there are two transitions of the type δ(q,a)=q1 y δ(q,a)=q2, siendo q1 ≠ q2;
That there exist transitions of the type δ (q, ε), where ε is the empty string, unless q is a final
state, without transitions to other states.
TRANSITIONS DIAGRAM
As an intermediate step in the construction of a lexical analyzer, first a stylized flow diagram,
called the transitions diagram, is produced. The transitions diagrams represent the actions that
take place when the lexical analyzer is called by the parser to obtain the next lexical component.
A transition diagram is used to locate the information about the characters that are detected as
the front pointer examines the entry. This is done by changing the position in the diagram as the
characters are read.

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

cidecame. (06 de 08 de 2013). cidecame. Obtenido de cidecame:


http://cidecame.uaeh.edu.mx/lcc/mapa/PROYECTO/libro32/251_diagrama_de_transic
iones.html

codingornot. (03 de 09 de 2014). codingornot. Obtenido de codingornot:


https://codingornot.com/que-es-un-automata

ecured. (14 de 09 de 2009). ecured. Obtenido de ecured:


https://www.ecured.cu/Aut%C3%B3mata_finito_determinista

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy