The unary rule does nothing, simply skipping the node, and the binary rule concatenates two sub-computations in A σ : Finally, we need transitions to process leaf nodes at the treelets in D , where we need to simulate transitions of A σ that process edges copied from the original DAG D. Recall that these copied edges are labeled with states in Q, whereas in A σ states from Q are indicative of outgoing edges.
we use the following transitions: The following transitions handle the special case of a treelet consisting of a single node: Once M has been constructed from M, we can process each input DAG D by converting it into a binary DAG D and then by running M on D using Algorithm 2.