The Software Package BALM - The Unknown Component Problem: Theory and Applications - page 132

Case 2 : only one state is accepting

.table CS -> Acc
.default 0
<acc_state> 1
This specifies that state “acc state” is the only accepting state.
Case 3 :

only one state is non-accepting

.table CS -> Acc
.default 1
<non_acc_state> 0
This specifies that state “non acc state” is the only non-accepting state
Case 4 : several accepting states

.table CS -> Acc
.default 0
(comma-separated list of accepting states in parentheses) 1
or

.table CS -> Acc
.default 1
(comma-separated list of non-accepting states in parentheses) 0
Example 8.2. We show an example of a simple 3-state automaton with accepting
state “ DC ” represented using the AUT format:

.model spec
.inputs i o
.outputs Acc

.mv CS, NS 3 a b DC #there are 3 states named a b and DC
.mv i 3 #input i has 3 values. By default their names are 0,1,2

.latch NS CS #declares one latch with input NS and output CS
.reset CS #its initial value is a
a

.table CS ->Acc #the only accepting state is DC
.default 0
DC 1

.table i o CS ->NS #the next-state table
.default DC
(1,2) 1 a a #if i = 1 or 2, and o =1 and CS=a, then NS=a

- 0 a b

0 1 b a

.end