Thus, in this respect our DAG automata are similar to those by Kamimura and Slutzki (1981), whose path languages are trivially regular.
if we restrict recognizable DAG languages to DAGs with only one root, then this no longer holds.