Maximality on Construction of Ternary Cross Bifix Free Code
نویسندگان
چکیده
منابع مشابه
A Gray Code for cross-bifix-free sets
A cross-bifix-free set of words is a set in which no prefix of any length of any word is the suffix of any other word in the set. A construction of cross-bifix-free sets has recently been proposed by Chee et al. in 2013 within a constant factor of optimality. We propose a trace partitioned Gray code for these cross-bifix-free sets and a CAT algorithm generating it.
متن کاملCross-bifix-free sets in two dimensions
A bidimensional bifix (in short bibifix ) of a square matrix T is a square submatrix of T which occurs in the top-left and bottomright corners of T . This allows us to extend the definition of bifix-free words and cross-bifix-free set of words to bidimensional structures. In this paper we exhaustively generate all the bibifix -free square matrices and we construct a particular non-expandable cr...
متن کاملBond-Free Languages: Formalizations, Maximality and Construction Methods
The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA computations. We recall a few existing formalizations of the problem and then define the property of sim-bond-freedom, where sim is a similarity relation between words. We show that this property is decidable for context-...
متن کاملComplexity of regular bifix-free languages
We study descriptive complexity properties of the class of regular bifix-free languages, which is the intersection of prefix-free and suffix-free regular languages. We show that there exist a single ternary universal (stream of) bifix-free languages that meet all the bounds for the state complexity basic operations (Boolean operations, product, star, and reversal). This is in contrast with suff...
متن کاملSyntactic Complexity of Bifix-Free Languages
We study the properties of syntactic monoids of bifix-free regular languages. In particular, we solve an open problem concerning syntactic complexity: We prove that the car-dinality of the syntactic semigroup of a bifix-free language with state complexity n is at most (n−1) n−3 +(n−2) n−3 +(n−3)2 n−3 for n 6. The main proof uses a large construction with the method of injective function. Since ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ComTech: Computer, Mathematics and Engineering Applications
سال: 2019
ISSN: 2476-907X,2087-1244
DOI: 10.21512/comtech.v10i1.4716