Computation of Flexibility in Sequential Networks - The Unknown Component Problem: Theory and Applications - page 170

.

The automaton is incomplete (13 states) and deterministic

13 inputs 13 states 39 transitions
Inputs = { v6, v5, v4, v3, v2, v1, v0, v9, v8, v7, v12, v11, v10 }

s00

s04

s10

s05

s12

s13

s14

s15

s16

s17

s01

s08 s09

Fig. 10.8 Graphical output of BALM showing the automaton MBifsm.aut generated by the
script W&B-K&N script - example s386.blif . The automaton represents the incom-
pletely specified FSM created by Wang-Brayton's procedure