Open. closed. open

9Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As a window into the subject, we recount some of the history (and geography) of two mature, challenging, partially open, partially closed problems in the theory of rewriting (numbers 13 and 21 from the original RTA List of Open Problems). One problem deals with (criteria for left-linear) confluence and the other with termination (of one linear or string rule), the two paradigmatic properties of interest for rewrite systems of any flavor. Both problems were formulated a relatively long time ago, have seen considerable progress, but remain open. We also venture to contemplate the future evolution and impact of these investigations. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Dershowitz, N. (2005). Open. closed. open. In Lecture Notes in Computer Science (Vol. 3467, pp. 376–393). Springer Verlag. https://doi.org/10.1007/978-3-540-32033-3_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free