نتایج جستجو برای: rewriting system
تعداد نتایج: 2239035 فیلتر نتایج به سال:
In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and termination in binary and decimal term rewriting systems for both append and tree constructor functions. We find that some of these term rewriting systems are no...
Meseguer’s rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed with different objectives. Here we study the relationships between them, both at a syntactic and at a semantic level. It is not possible to establish an entailment system map between them, but both can be naturally simulated...
در سالهای اخیر شناسایی نوری نویسه به عنوان یکی از حوزه های فعال در مبحث شناسایی الگو است. اگرچه تحقیقات بر روی کلمات دستنویس فارسی (عربی) در سالهای گذشته پیشرفت بسزایی کرده است، اما در مقایسه با کلمات لاتین جای پیشرفت دارد. البته کارهای انجام شده در این زمینه حاوی اطلاعات مفید برای بالا بردن ضریب اطمینان است. در این پایان نامه سعی بر این است که در حوزه شناسایی نوری نویسه و به خصوص کلمات دستنوی...
This paper shows that “root-only” rewrite relations with respect to term rewriting systems can be expressed using Kleene star operations in a gs-monoidal Kleene category with converse. In our framework, we can analyze some properties of term rewriting systems by computing rewrite descendants of tree languages. As an application, we consider an infinite state model-checking problem given by a te...
Circular coinductive rewriting is a new method for proving behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implemented in our new BOBJ behavioral specification and computation system, which is used in examples throughout this paper. These examples demonstrate the surprising power of circular coinductive rewriting. The paper also sketches the u...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term rewriting. Algebraic and lambda terms are mixed by adding the symbols of the algebraic signature to the polymorphic lambda calculus, as higher-order constants. We show that if a many-sorted algebraic rewrite system R has the Church-Rosser property (is confluent), then R + β + type-β + type-η rewrit...
Term rewriting systems are widely used throughout computer science as they provide an abstract model of computation while retaining a comparatively simple syntax and semantics. In order to reason within large term rewriting systems, structuring operations are used to build large term rewriting systems from smaller ones. Of particular interest is whether key properties are modular, that is, if t...
The tree automaton completion is an algorithm used for proving safety properties on systems which can be modeled by a term rewriting system. This representation and verification technique works well for proving properties on infinite systems like cryptographic protocols or more recently on Java Bytecode programs. This algorithm computes a tree automaton which represents a (regular) over approxi...
Abstract We explore the Collatz conjecture and its variants through lens of termination string rewriting. construct a rewriting system that simulates iterated application function on strings corresponding to mixed binary–ternary representations positive integers. prove this is equivalent conjecture. also previously studied using unary does not admit proofs via natural matrix interpretations, ev...
The rewriting calculus is a rule construction and application framework. As such it embeds in a uniform way term rewriting and lambda-calculus. Since rule application is an explicit object of the calculus, it allows us also to handle the set of results explicitly. We present a simply typed version of the rewriting calculus. With a good choice of the type system, we show that the calculus is typ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید