Escolar Documentos
Profissional Documentos
Cultura Documentos
DFSA redirects here. DFSA may also refer to Drug fa- analysis and pattern matching. DFAs can be built
cilitated sexual assault. from nondeterministic nite automata (NFAs) using the
In automata theory, a branch of theoretical computer powerset construction method.
Start
1 0
1 Formal denition
1
0
S0 S1 S2 A deterministic nite automaton M is a 5-tuple, (Q, ,
, q0, F), consisting of
1 0
a nite set of states (Q)
An example of a deterministic nite automaton that accepts only
binary numbers that are multiples of 3. The state S0 is both the
start state and an accept state. a nite set of input symbols called the alphabet ()
1
2 5 LOCAL AUTOMATA
Concatenation
Negation
Kleene closure
Reversal
Init
Quotient
Substitution
The state diagram for M
Homomorphism
A Myhill graph over an alphabet A is a directed graph brackets inside, and hence would require an innite num-
with vertex set A and subsets of vertices labelled start ber of states to recognize. Another simpler example is the
and nish. The language accepted by a Myhill graph language consisting of strings of the form an bn for some
is the set of directed paths from a start vertex to a nish nite but arbitrary number of a's, followed by an equal
vertex: the graph thus acts as an automaton.[5] The class number of b's.[10]
of languages accepted by Myhill graphs is the class of
local languages.[7]
7 See also
6 Advantages and disadvantages Acyclic deterministic nite automata
Monadic second-order logic
DFAs were invented to model real world nite state ma-
chines in contrast to the concept of a Turing machine, Quantum nite automata
which was too general to study properties of real world
machines. Read-only right moving Turing Machines
DFAs are one of the most practical models of computa- Turing machine
tion, since there is a trivial linear time, constant-space,
online algorithm to simulate a DFA on a stream of input. Two-way deterministic nite automaton
Also, there are ecient algorithms to nd a DFA recog-
nizing:
8 Notes
the complement of the language recognized by a
given DFA. [1] Hopcroft 2001:
the union/intersection of the languages recognized [2] McCulloch and Pitts (1943):
by two given DFAs. [3] Rabin and Scott (1959):
whether two DFAs recognize the same language [9] Lawson (2004) p.63
the DFA with a minimum number of states for a [10] Lawson (2004) p.46
particular regular language
10 External links
DFA Simulator - an open source graphical editor
and simulator of DFA
5
11.2 Images
File:DFA_example_multiplies_of_3.svg Source: http://upload.wikimedia.org/wikipedia/commons/9/94/DFA_example_multiplies_
of_3.svg License: Public domain Contributors: Own work Original artist: Self-made
File:DFAexample.svg Source: http://upload.wikimedia.org/wikipedia/commons/9/9d/DFAexample.svg License: Public domain Contrib-
utors: Own work Original artist: Cepheus