We define the class of constrained cons-free rewriting systems and show that this class characterizes P, the set of languages decidable in polynomial time on a deterministic Turing machine. The main novelty of the characterization is that it allows very liberal properties of term rewriting, in particular non-deterministic evaluation: no reduction strategy is enforced, and systems are allowed to be non-confluent. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
De Carvalho, D., & Simonsen, J. G. (2014). An implicit characterization of the polynomial-time decidable sets by cons-free rewriting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8560 LNCS, pp. 179–193). Springer Verlag. https://doi.org/10.1007/978-3-319-08918-8_13
Mendeley helps you to discover research relevant for your work.