Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including notions like termination and con uence. We describe an e cient implementation of behavioral rewriting that uses standard rewriting. Circular coinductive rewriting combines behavioral rewriting with circular coinduction, gi...

In synchronous rewriting, the productions of two rewriting systems are paired and applied synchronously in the derivation of a pair of strings. We present a new synchronous rewriting system and argue that it can handle certain phenomena that are not covered by existing synchronous systems. We also prove some interesting formal/computational properties of our system.

Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving between deduction and computation (i.e., rewriting) steps. If the logic of reasoning supports partial functions, it is necessary that rewriting copes with pot...

In this paper presents a method that combines with techniques L-system and Genetic Algorithms (GA) to search for a rewriting expression describing leaf shapes. L-system is used to construct a shape of leaf of a given rewriting expression, and GA is used to search an unknown rewriting expression's fitting parameters. Replacement of real value parameters to tag-function is introduced. The result ...

-Rewriting systems are popular in end-user prcgramming because complex behavior can be described with few or no abstractions or variables. However, rewriting systems have been limited t o manipulating non-rotatable objects on a grid, such as in Agentsheets or Stageeast Creator. Systems that allow free-form movement of objects must use other techniques, such as the sequential programming by demo...

Given a monoid string rewriting system M , one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is well known that this algorithm is equivalent to computing a noncommutative Gröbner basis for M . This article develops an alternative approach, using noncommutative involutive basis methods to obtain a complete involuti...

A nite string-rewriting system R preserves regularity if and only if it preserves-regularity, where is the alphabet containing exactly those letters that have occurrences in the rules of R. This proves a conjecture of Gyenizse and VV agvv olgyi (1995). In addition, some undecidability results are presented that generalize some results of Gilleron and Ti-son (1995) from term-rewriting systems to...

Conditional rewriting is universally recognized as being much more complicated than unconditional rewriting In this paper we study how much of conditional rewriting can be automatically inferred from the simpler theory of unconditional rewriting We introduce a new tool called unraveling to automatically translate a conditional term rewriting system CTRS into a term rewriting system TRS An unrav...

A finite complete rewriting system for a group is a finite presentation which gives an algorithmic solution to the word problem. Finite complete rewriting systems have proven to be useful objects in geometric group theory, yet little is known about the geometry of groups admitting such rewriting systems. We show that a group G with a finite complete rewriting system admits a tame 1-combing; it ...