AbstractA language L ⊆ X* is called cohesive prefix code if xLy ∩ L ≠ ∅ implies that y = 1 and xL ⊆ 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 maximal infix codes and maximal cohesive prefix codes. Finally, we determine the structure of a cohesive prefix code that is a right semaphore code
Abstract. Given any unbounded and non-decreasing sequence f of positive integers, we define an infin...
AbstractWe give a simplified presentation of groups in transformation monoids. We use this presentat...
In this paper we discuss the problem of constructing minimum-cost, prefix-free codes for equiprobabl...
AbstractA language L ⊆ X* is called cohesive prefix code if xLy ∩ L ≠ ∅ implies that y = 1 and xL ⊆ ...
AbstractIn this paper we introduce the concepts of k-p-infix codes, n-k-ps-infix languages, n-k-infi...
ABSTRACT: In this paper we introduce the concepts of k-p-infiix codes, n-k-ps-infix languages, n-k-i...
In this paper we consider a prefix code in algebraic theory of code which are the fundamental exampl...
AbstractA language L such that no word in L is a proper factor of another word in L is said to be an...
In this paper, we consider a prefix code in algebraic theory of code which is the fundamental exampl...
AbstractThis paper proves that a 3-infix-outfix code is a maximal code if and only if it is a group ...
A language is prefix-continuous if it satisfies the condition that, if a word w and its prefix u are...
In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effe...
The set of (finite full prefix) codes on a given alphabet is endowed with the structure of a monoïd ...
International audienceWe give a simplified presentation of groups in transformation monoids. We use ...
Correspondences between codes and groupoid words are established: between maximal suffix codes and g...
Abstract. Given any unbounded and non-decreasing sequence f of positive integers, we define an infin...
AbstractWe give a simplified presentation of groups in transformation monoids. We use this presentat...
In this paper we discuss the problem of constructing minimum-cost, prefix-free codes for equiprobabl...
AbstractA language L ⊆ X* is called cohesive prefix code if xLy ∩ L ≠ ∅ implies that y = 1 and xL ⊆ ...
AbstractIn this paper we introduce the concepts of k-p-infix codes, n-k-ps-infix languages, n-k-infi...
ABSTRACT: In this paper we introduce the concepts of k-p-infiix codes, n-k-ps-infix languages, n-k-i...
In this paper we consider a prefix code in algebraic theory of code which are the fundamental exampl...
AbstractA language L such that no word in L is a proper factor of another word in L is said to be an...
In this paper, we consider a prefix code in algebraic theory of code which is the fundamental exampl...
AbstractThis paper proves that a 3-infix-outfix code is a maximal code if and only if it is a group ...
A language is prefix-continuous if it satisfies the condition that, if a word w and its prefix u are...
In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effe...
The set of (finite full prefix) codes on a given alphabet is endowed with the structure of a monoïd ...
International audienceWe give a simplified presentation of groups in transformation monoids. We use ...
Correspondences between codes and groupoid words are established: between maximal suffix codes and g...
Abstract. Given any unbounded and non-decreasing sequence f of positive integers, we define an infin...
AbstractWe give a simplified presentation of groups in transformation monoids. We use this presentat...
In this paper we discuss the problem of constructing minimum-cost, prefix-free codes for equiprobabl...
DOI
Add to ORKG