[1]
E. Jurvanen, “The Boolean closure of DR-recognizable tree languages”, Acta Cybern, vol. 10, no. 4, pp. 255-272, Jan. 1992.