Undecidability of ground reducibility for word rewriting systems with variables

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Download / Buy Article:

Keywords: Formal languages; Pattern matching; Term rewriting systems; Theory of computation

Document Type: Research Article

DOI: http://dx.doi.org/10.1016/0020-0190(94)00188-5

Affiliations: CRIN and INRIA-Lorraine, Campus Scientifique, BP 239, F-54506 Vandoeuvre-les-Nancy, France

Publication date: February 24, 1995

Related content

Tools

Favourites

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more