Infinite Families of Finite String Rewriting Systems and Their Confluence
نویسندگان
چکیده
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reason uniformly over these families. Unlike previous work, the vocabulary on which a rewrite system in the family is built depends itself on the integer parameters. Rewriting makes use of a toolkit for parameterized words which allows to describe a rewrite step made independently by all systems in an infinite family by a single, effective parameterized rewrite step. The main result is a confluence test for all systems in a family at once, based on a critical pair lemma classically based on computing finitely many overlaps between lefthand sides of parameterized rules and then checking for their joinability (which decidability is not garanteed).
منابع مشابه
On modularity in infinitary term rewriting
We study modular properties in strongly convergent infinitary term rewriting. In particular, we show that: • Confluence is not preserved across direct sum of a finite number of systems, even when these are non-collapsing. • Confluence modulo equality of hypercollapsing subterms is not preserved across direct sum of a finite number of systems. • Normalization is not preserved across direct sum o...
متن کاملSeparability of Infinite Lambda Terms
Infinite lambda calculi extend finite lambda calculus with infinite terms and transfinite reduction. In this paper we extend some classical results of finite lambda calculus to infinite terms. The first result we extend to infinite terms is Böhm Theorem which states the separability of two finite βη-normal forms. The second result we extend to infinite terms is the equivalence of the prefix rel...
متن کاملInfinite Words and Confluent Rewriting Systems: Endomorphism Extensions
Infinite words over a finite special confluent rewriting system R are considered and endowed with natural algebraic and topological structures. Their geometric significance is explored in the context of Gromov hyperbolic spaces. Given an endomorphism φ of the monoid generated by R, existence and uniqueness of several types of extensions of φ to infinite words (endomorphism extensions, weak endo...
متن کاملRational Term Rewriting Revisited: Decidability and Confluence
We consider a variant of rational term rewriting as first introduced by Corradini et al., i.e., we consider rewriting of (infinite) terms with a finite number of different subterms. Motivated by computability theory, we show a number of decidability results related to the rewrite relation and prove an effective version of a confluence theorem for orthogonal systems.
متن کاملConfluence of Length Preserving String Rewriting Systems is Undecidable
Confluence that ensures the uniqueness of results of computation is one of important properties on rewriting systems. In this paper, we show undecidability of confluence for length preserving string rewriting systems (SRSs) and prove it by reducing the Post’s correspondence problem (PCP), which is known to be undecidable, to confluence problem of length preserving string rewriting systems. More...
متن کامل