It is undecidable if two regular tree languages can be separated by a deterministic tree-walking automaton.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/corr/Bojanczyk17
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/corr/Bojanczyk17
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mikolaj_Bojanczyk
>
foaf:
homepage
<
http://arxiv.org/abs/1703.04997
>
dc:
identifier
DBLP journals/corr/Bojanczyk17
(xsd:string)
dcterms:
issued
2017
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/corr
>
rdfs:
label
It is undecidable if two regular tree languages can be separated by a deterministic tree-walking automaton.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mikolaj_Bojanczyk
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/corr/Bojanczyk17/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/corr/Bojanczyk17
>
rdfs:
seeAlso
<
http://arxiv.org/abs/1703.04997
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/corr/corr1703.html#Bojanczyk17
>
dc:
title
It is undecidable if two regular tree languages can be separated by a deterministic tree-walking automaton.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
abs/1703.04997
(xsd:string)