Hardware Reference
In-Depth Information
b
a
i, v
1
,v
2
i
1
2
c
a
o
1
o
1
o
2
u
1
v
1
u
1
,u
2
d
1
2
b
e
v
2
v
1
,v
2
u
2
(
b
)
c
v
1
,v
2
dc
2
u
2
u
1
,u
2
dc
1
a
1
,c
2
u
1
u
1
u
1
u
2
e
4
u
2
v
2
b
2
d
4
,aF,c
4
v
1
u
2
u
2
aF, d
2
,c
4
u
1
v
2
v
1
u
1
e
2
b
4
d
v
1
,v
2
u
2
1
2
5
u
1
,u
2
u
1
u
1
v
1
3
4
u
2
D
L
r
.M
A
/;(
b
)FAofC
L
r
.M
C
/;(
b
0
)
Fig. 3.10
Illustration of
Example
3.29
.(
a
)FAofA
D
FA of .U V /
?
;(
c
)FAof.A
\
.C
\
.U V /
?
;(
d
) FA of prefix-closure of
\
.IO/
?
/
*
U
[
V
/
+
U
[
V
\
.U V /
?
.A
\
.C
\
.IO/
?
/
*
U
[
V
/
+
U
[
V
automata shown, re
spectively, in Fig.
3.10
a,b. The
automata generating the largest
language solution, .A
\
.C
\
.U V /
?
\
.IO/
?
/
*
U
[
V
/
+
U
[
V
and its largest prefix
closure are portrayed, respectively, in Fig.
3.10
c,d.
Figs.
3.11
and
3.12
show the intermediate steps of the computation. Notice that
in Fig.
3.10
c there are two don't care states,
dc1
non-accepting and
dc2
accepting,
obtained
by “splitting” the accepting
dc
state of the automaton recognizing the
language .A
\
.C
\
.IO/
?
/
*
U
[
V
/
+
U
[
V
in Fig.
3.12
b, when it is intersected with
Search WWH ::
Custom Search