It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton
From MaRDI portal
Publication:4601120
DOI10.3233/FI-2017-1551zbMath1390.68374arXiv1703.04997OpenAlexW2603819657MaRDI QIDQ4601120
Publication date: 19 January 2018
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.04997
Related Items