Previous Algorithm: Illustration
1)
for each
a
Î
T
:
Empty
(
a
) :=
Æ
because
a
Þ
*
e
2)
for each
r
:
A
®
e
Î
P
:
Empty
(
A
) := {
e
} because
A
Þ
1
e
[
r
]
Empty
(
A
) = {
e
}
e
e
e
…
e
•
if
A
®
X
1
X
2
…
X
n
Î
P
and
Empty
(
X
i
) = {
e
}
for all
i
= 1,…,
n
then
Empty
(
A
) = {
e
}
•
A
X
1
X
2
…
X
n
3)
Apply the following rules until no
Empty
set can be
changed:
18/57