Complete Variable-Length Codes: An Excursion into Word Edit Operations

12/05/2019
by   Jean Néraud, et al.
0

Given an alphabet A and a binary relation τ⊆ A * x A * , a language X ⊆ A * is τ-independent if τ (X) ∩ X = ∅; X is τ-closed if τ (X) ⊆ X. The language X is complete if any word over A is a factor of some concatenation of words in X. Given a family of languages F containing X, X is maximal in F if no other set of F can stricly contain X. A language X ⊆ A * is a variable-length code if any equation among the words of X is necessarily trivial. The study discusses the relationship between maximality and completeness in the case of τ-independent or τ-closed variable-length codes. We focus to the binary relations by which the images of words are computed by deleting, inserting, or substituting some characters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/29/2021

Variable-Length Codes Independent or Closed with respect to Edit Relations

We investigate inference of variable-length codes in other domains of co...
research
10/19/2020

Gray codes for Fibonacci q-decreasing words

An n-length binary word is q-decreasing, q≥ 1, if every of its length ma...
research
09/06/2023

Words-to-Letters Valuations for Language Kleene Algebras with Variable Complements

We investigate the equational theory of Kleene algebra terms with variab...
research
08/31/2022

When Variable-Length Codes Meet the Field of Error Detection

Given a finite alphabet A and a binary relation τ⊆ A^*× A^*, a set X is ...
research
09/29/2022

Enumerating Regular Languages in Constant Delay

We study the task, for a given language L, of enumerating the (generally...
research
06/16/2018

Finding Short Synchronizing Words for Prefix Codes

We study the problems of finding a shortest synchronizing word and its l...
research
05/31/2018

On Prefix Normal Words

We present a new class of binary words: the prefix normal words. They ar...

Please sign up or login with your details

Forgot password? Click here to reset