In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
Abstract. This paper is a contribution to the long standing open problem of uniform termination of Semi-Thue Systems that consist of one rule s → t. McNaughton previously showed ...
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
Harald Zankl, Christian Sternagel, Dieter Hofbauer...
■ Humans commonly understand the unobservable mental states of others by observing their actions. Embodied simulation theories suggest that this ability may be based in areas of...
Robert P. Spunt, Ajay B. Satpute, Matthew D. Liebe...
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...