We now show that the path language of a recognizable DAG language is always a regular string language.
the first two statements follow directly from the fact that a DAG language is empty (finite) if and only if its binarized counterpart is empty (finite, respectively).