It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton (Q4601120)
From MaRDI portal
scientific article; zbMATH DE number 6827705
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton |
scientific article; zbMATH DE number 6827705 |
Statements
It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton (English)
0 references
19 January 2018
0 references
regular tree language
0 references
tree-walking automaton
0 references
separation of languages
0 references
undecidability
0 references
