Figure 4.
Second uppass procedures. If a node’s ancestor is inapplicable, its state requires no further modification (a). If a node contains applicable tokens and its ancestor has no states in common with its applicable descendant(s), the ancestral states are added to to the node’s (b); but if its ancestor and descendants do have states in common, these common states become the node’s states (c).

Second uppass procedures. If a node’s ancestor is inapplicable, its state requires no further modification (a). If a node contains applicable tokens and its ancestor has no states in common with its applicable descendant(s), the ancestral states are added to to the node’s (b); but if its ancestor and descendants do have states in common, these common states become the node’s states (c).

Close
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close

This PDF is available to Subscribers Only

View Article Abstract & Purchase Options

For full access to this pdf, sign in to an existing account, or purchase an annual subscription.

Close