Serialisation Graph

The $\alpha\beta$-serialisation of an AF $F$ is the graph of all serialisation states reachable from $(F, \emptyset)$ in the serialisation system of a selection function $\alpha$, with an edge labelled $S$ for each transition that adds the initial set $S$. The states accepted by a termination function $\beta$ are highlighted; they form $\mathcal{E}_{\alpha,\beta}(F)$.