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

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Mikołaj Bojańczyk

Journal title: Fundamenta Informaticae

Journal number: 154/1-4

Journal publisher: IOS Press

Published year: 2017

Published pages: 37-46

DOI identifier: 10.3233/FI-2017-1551

ISSN: 0169-2968