Estados Presentes

Estados Futuros

Entradas de los Flip-Flops

A1

B1

C1

D1

Ja

Ka

Jb

Kb

Jc

Kc

Jd Kd

Desarrollando los mapas de Karnaugh correspondientes a la minimizacin de la

lgica combinacional:

00
01
11
10

0
0
0
0
X
X

0
1
0
0
X
X

1
1
0
1
X
X

10
0
0
X
X

00
01
11
10

0
0
X
X
1
0

0
1
X
X
1
1

1
1
X
X
1
1

10
X
X
1
1

0
1
0
X
X
0

1
1
1
X
X
0

10

00
01
11
10

0
0
0
X
X
0

0
1
1
1
0
0

1
1
X
X
X
X

10

00
01
11
10

0
0
0
0
0
0

0
X
X
0

X
X
X
X

0
1
X
0
1
X

1
1
X
1
1
X

10

00
01
11
10

0
0
X
0
1
X

0
1
X
X
X
X

1
1
1
1
1
1

10

00
01
11
10

0
0
X
X
X
X

X
0
1
X

0
0
1
1

00
01
11
10

0
0
1
1
0
1

0
1
X
X
X
X

1
1
X
X
X
X

10
1
1
0
0

00
01
11
10

0
0
X
X
X
X

0
1
1
1
1
1

1
1
1
1
1
1

10
X
X
X
X