Infinite periodic points of endomorphisms over special confluent rewriting systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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...

متن کامل

Confluent Rewriting systems in Non-Monotonic Reasoning

Non-profit academic project, developed under the open access initiative

متن کامل

On Weakly Confluent Monadic String-Rewriting Systems

Madlener, K., P. Narendran, F. Otto and L. Zhang, On weakly confluent monadic string-rewriting systems, Theoretical Computer Science 113 (1993) 119-165. It is investigated as to how far the various decidability results for finite, monadic, and confluent string-rewriting systems can be carried over to the class of finite monadic string-rewriting systems that are only weakly confluent. Here a mon...

متن کامل

Confluent Term Rewriting Systems with Membership Conditions

1. I n t r o d u c t i o n Many term rewriting systems and their modifications are considered in logic, automated theorem proving, and programming language [2,3,4,6,8,9]. A fundamental property of term rewriting systems is the confluence property. A few sufficient criteria for the confluence are well known [2,3,4,5,8,9]. However, if a term rewriting system is nonterminating and nonlinear, we kn...

متن کامل

Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General

A nite special and connuent string-rewriting system S is constructed such that it is undecidable in general whether a word equation is solvable mod S. Thus, (word) uniication mod S is undecidable.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales de l’institut Fourier

سال: 2009

ISSN: 0373-0956,1777-5310

DOI: 10.5802/aif.2447