Uniformly bounded duplication codes
نویسندگان
چکیده
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing duplications, one can eventually reach a square-free word, the original word’s duplication root. The duplication root is unique, if the length of duplications is fixed. Based on these unique roots we define the concept of duplication code. Elementary properties are stated, then the conditions under which infinite duplication codes exist are fully characterized; the relevant parameters are the duplication length and alphabet size. Finally, some properties of the languages generated by duplication codes are investigated. Mathematics Subject Classification. 68R15, 68Q45, 94B60.
منابع مشابه
Existence Results of best Proximity Pairs for a Certain Class of Noncyclic Mappings in Nonreflexive Banach Spaces Polynomials
Introduction Let be a nonempty subset of a normed linear space . A self-mapping is said to be nonexpansive provided that for all . In 1965, Browder showed that every nonexpansive self-mapping defined on a nonempty, bounded, closed and convex subset of a uniformly convex Banach space , has a fixed point. In the same year, Kirk generalized this existence result by using a geometric notion of ...
متن کاملRobust Lyapunov-based Control of MEMS Optical Switches
In this paper, a robust PID control scheme is proposed for Micro-Electro-Mechanical-Systems (MEMS) optical switches. The proposed approach is designed in a way which solves two challenging and important problems. The first one is successful reference tracking and the second is mitigating the system nonlinearities. The overall system composed of nonlinear MEMS dynamics and the PID controller is ...
متن کاملBounded Prefix-Suffix Duplication
Abs t r ac t . We consider a restricted variant of the prefix-sufñx duplication operation, called bounded prefix-sufñx duplication. It consists in the iterative duplication of a prefix or suffix, whose length is bounded by a constant, of a given word. We give a sufncient condition for the closure under bounded prefix-sufñx duplication of a class of languages. Consequently, the class of regular ...
متن کاملRobust Lyapunov-based Control of MEMS Optical Switches
In this paper, a robust PID control scheme is proposed for Micro-Electro-Mechanical-Systems (MEMS) optical switches. The proposed approach is designed in a way which solves two challenging and important problems. The first one is successful reference tracking and the second is mitigating the system nonlinearities. The overall system composed of nonlinear MEMS dynamics and the PID controller is ...
متن کاملFixed points for total asymptotically nonexpansive mappings in a new version of bead space
The notion of a bead metric space is defined as a nice generalization of the uniformly convex normed space such as $CAT(0)$ space, where the curvature is bounded from above by zero. In fact, the bead spaces themselves can be considered in particular as natural extensions of convex sets in uniformly convex spaces and normed bead spaces are identical with uniformly convex spaces. In this paper, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITA
دوره 41 شماره
صفحات -
تاریخ انتشار 2007