The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/icalp/NarendranO97
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/icalp/NarendranO97
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Friedrich_Otto
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Paliath_Narendran
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F3-540-63165-8%5F218
>
foaf:
homepage
<
https://doi.org/10.1007/3-540-63165-8_218
>
dc:
identifier
DBLP conf/icalp/NarendranO97
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F3-540-63165-8%5F218
(xsd:string)
dcterms:
issued
1997
(xsd:gYear)
rdfs:
label
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Friedrich_Otto
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Paliath_Narendran
>
swrc:
pages
638-648
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/icalp/1997
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/icalp/NarendranO97/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/icalp/NarendranO97
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/icalp/icalp97.html#NarendranO97
>
rdfs:
seeAlso
<
https://doi.org/10.1007/3-540-63165-8_218
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/icalp
>
dc:
subject
matching; unification; equational theory; string-rewriting systems
(xsd:string)
dc:
title
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document