Finite automata, bounded treewidth, and well-quasiordering.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/gst/AbrahamsonF91
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/gst/AbrahamsonF91
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Karl_R._Abrahamson
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Michael_R._Fellows
>
dc:
identifier
DBLP conf/gst/AbrahamsonF91
(xsd:string)
dcterms:
issued
1991
(xsd:gYear)
rdfs:
label
Finite automata, bounded treewidth, and well-quasiordering.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Karl_R._Abrahamson
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Michael_R._Fellows
>
swrc:
pages
539-563
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/gst/1991
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/gst/AbrahamsonF91/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/gst/AbrahamsonF91
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/gst/gst1991.html#AbrahamsonF91
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/gst
>
dc:
title
Finite automata, bounded treewidth, and well-quasiordering.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document