k-p-Infix codes and semaphore codes
نویسندگان
چکیده
In this paper we introduce the concepts of k-p-in x codes, n-k-ps-in x languages, n-k-in xout x codes, and n-k-pre x-su x languages, which are natural generalizations of our previous work on k-pre x codes, k-in x codes and so on. We obtain several properties of k-p-in x codes and semaphore codes. The relations and hierarchies of k-p-in x codes, n-k-ps-languages, and n-kpre x-su x languages, and their operations of these classes of languages are also investigated. ? 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Product of Finite Maximal P-Codes
Several properties of the products of finite maximal prefix, maximal biprefix, semaphore, synchronous, maximal infix and maximal outfix codes are discussed respectively. We show that, for two nonempty subsets X and Y of A such that the product XY being thin, if XY is a maximal biprefix code, then X and Y are maximal biprefix codes. Also, it is shown that, for two finite nonempty subsets X and Y...
متن کاملCongruences, Infix and Cohesive Prefix Codes
Ito, M. and G. Thierrin, Congruences, infix and cohesive prefix codes, Theoretical Computer Science 136 (1994) 471 485. A language L _~ X * is called a cohesive prefix code if xLyc~L ~ 0 implies that y = 1 and xL c L for any x, y~X*. An example of cohesive prefix codes is an infix code. We determine first the structure of cohesive prefix codes and then we study several relationships between max...
متن کاملNotes on Finite Maximal Infix Codes 1
The fact that every finite infix code is contained in a finite maximal infix code was given in 1994 by Ito and Thierrin. In this paper, we construct two kinds of maximal infix codes from a finite maximal infix code. Then we show that a finite infix code is a finite intersection of some finite maximal infix codes.
متن کاملA note on the groups of some codes
The starting point of this note is the article On the synchronizing properties of certain prefix codes published by Schützenberger in 1964 [2]. This article presents a family of maximal prefix codes called J -codes, that we call semaphore codes. The main result is that a semaphore code is always of the form X where X is a synchronized semaphore code and n ≥ 1. Two proofs are presented of this r...
متن کاملOn the Decidability of 2-Infix-Outfix Codes
The theory of codes is a fertile area at the intersection of formal language theory, error detection and correction, data compression and data security [6]. Theoretical research into codes is often interested with combinatorial properties of formal languages related to codes. In particular, there has been substantial recent interest in classes of codes defined by certain “finite subset” conditi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 109 شماره
صفحات -
تاریخ انتشار 2001