More results on the (non-extended) DAG automata invented in this article were proved by Blum (2015) and Blum and Drewes (2016).
an alternative proof of the regularity of path languages was given in Blum (2015) (which is simpler and more constructive, but was conceived after the proof in Section 4.1), and the polynomial decidability of the finiteness problem was proved.