Proposition. Synchronization trees as rooted presheaves [mde-Y8GD]

If \(A\) is the set of labels, then synchronization trees are equivalently presheaves on the poset on \(A^\ast \) given by the prefix ordering, with the property (rootedness) that they map (\(\varnothing \)) to the terminal set (giving the initial state).