On the Complexity of Undecidable Problems in Automata Theory.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jacm/Hartmanis69
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jacm/Hartmanis69
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Juris_Hartmanis
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F321495.321507
>
foaf:
homepage
<
https://doi.org/10.1145/321495.321507
>
dc:
identifier
DBLP journals/jacm/Hartmanis69
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F321495.321507
(xsd:string)
dcterms:
issued
1969
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jacm
>
rdfs:
label
On the Complexity of Undecidable Problems in Automata Theory.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Juris_Hartmanis
>
swrc:
number
1
(xsd:string)
swrc:
pages
160-167
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jacm/Hartmanis69/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jacm/Hartmanis69
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jacm/jacm16.html#Hartmanis69
>
rdfs:
seeAlso
<
https://doi.org/10.1145/321495.321507
>
dc:
title
On the Complexity of Undecidable Problems in Automata Theory.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
16
(xsd:string)