rently there are 4 coins in the box.  Find the shortest
sequence of events that will make the box full.<p>

In terms of paths: find the shortest path from the vertex <i>c</i>=4 to the
vertex <i>c</i>=10. (Answer: path of length 6 with every edge labeled
<i>a</i>=<b>t</b>.)<p>

<hr><p>

<address><a href="input1.html">Forward</a>
to Section 1.1: CCalc Input: Transition Systems</a><br></address>

<address><a href="describing.html">Back</a>
to Section 0.2: Describing Actions</a><br></address>

<address><a href=