It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton

Mikolaj Bojanczyk. It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton. Fundamenta Informaticae, 154(1-4):37-46, 2017. [doi]

Abstract

Abstract is missing.