Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
0 of .
Results for:
P. 1
states minimization in Automata

# states minimization in Automata

Ratings: (0)|Views: 16|Likes:

### Availability:

See more
See less

09/21/2010

pdf

text

original

CS 273: Intro to Theory of Computation, Spring 2007DFA minimization
This DFA is more complex than it needs to be:
ACEGD F01010110,100H110B0,1
The DFA minimization algorithm marks which states are distinct. States not marked as distinct canthen be merged, to create a simpler DFA.Suppose
= (
Q,
Σ
,δ,q
0
,
) is a DFA. We deﬁne distinctness inductively. Speciﬁcally, two states
p
and
q
in
are distinct if a)
p
and
q
, or vice versa, orb) for some
a
Σ,
δ
(
p,a
) and
δ
(
q,a
) are distinctThe algorithm for marking distinct states follows this inductive deﬁnition. Create a table DISTINCTwith an entry for each pair of states. Table cells are initially blank.(1) For every pair of states (
p,q
)If p is ﬁnal and q is not, or vice versa,Set DISTINCT(p,q) to be
(2) Loop until there is no change in the table contentsFor each pair of states (p,q) and each character a in the alphabetif DISTINCT(p,q) is empty and DISTINCT(
δ
(
p,a
),
δ
(
q,a
)) is not emptySet DISTINCT(p,q) to be
a
.(3) Two states
p
and
q
are distinct iﬀ DISTINCT(p,q) is not empty.1