

![0_image_0.png](0_image_0.png)

ss one primitive operator  and the second step consists of applying another primitive operator Every one of the following operators preserves determinism and completeness of the FSAs In other words  if the FSA is deterministic and complete prior to operator application then it will be deterministic and complete afterwards Operator Schema 10 (Omove) This operator schema is identical to that of  change, with one exception.  Replace "and/or" with "and" in the definition.  In other words, we have K 1 3 = K 1 3 for some move x l K 
move
. Therefore move moves from one edge to another.

1 2 1 3 All of the remaining operators are special cases of move We begin with the right subtree of move Operator Schema 11 (Odelete+add) Apply  delete lo edge   1  2  and then apply  add lo edge   1   3  ·
STATE
is to delete edge  STATE
An example of  delete+add  using Figure   
i e make and add a new edge   STATE  
STATE
with transition condition Operator Schema 12 (Ospec+add) Apply spec to edge   1   2  and then apply  add to edge 1 3 ·
For example  using Figure    we can move  b" from edge  STATE
STATE to a newly created edge  STATE   STATE   to make       STATE     STATE
b and a k  STATE   STATE      b  This is specialization of the condition on edge  STATE
STATE   followed by addition of edge  STATE   STATE
Next consider the left subtree of  move  At this point  it is relevant to examine the reason for the split into the two subtrees of  move  All of the operators in the left subtree ssses the state of the control of the control of the control of the condition states that prior to learning  and also after learning   if vertex   is accessible from some initial state then vertex  3 is guaranteed to also be accessible from that initial state  The reason for tion this partition will become clear in Subsection where we show that a theorem holds for the two step operators if and only if the accessibility condition is true  The reason that the