Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"It is Undecidable if Two Regular Tree Languages can be Separated by a ..."

Mikolaj Bojanczyk (2017)

> Home

Details and statistics

DOI: 10.3233/FI-2017-1551

access: closed

type: Journal Article

metadata version: 2020-09-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/fuin/Bojanczyk17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/Bojanczyk17
Mikolaj Bojanczyk:
It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton. Fundam. Informaticae 154(1-4): 37-46 (2017)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.