Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/corr/abs-1210-2463
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/corr/abs-1210-2463
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Szczepan_Hummel
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.4204%2FEPTCS.96.19
>
foaf:
homepage
<
https://doi.org/10.4204/EPTCS.96.19
>
dc:
identifier
DBLP journals/corr/abs-1210-2463
(xsd:string)
dc:
identifier
DOI doi.org%2F10.4204%2FEPTCS.96.19
(xsd:string)
dcterms:
issued
2012
(xsd:gYear)
rdfs:
label
Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Szczepan_Hummel
>
swrc:
pages
247-260
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/journals/corr/abs-1210-2028
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/corr/abs-1210-2463/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/corr/abs-1210-2463
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/series/eptcs/eptcs96.html#abs-1210-2463
>
rdfs:
seeAlso
<
https://doi.org/10.4204/EPTCS.96.19
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/corr
>
dc:
title
Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document