Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms - Normandie Université Access content directly
Journal Articles Springer, LNCS. Year : 2017

Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms

Abstract

Let A be a finite or countable alphabet and let θ be literal (anti)morphism onto A * (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under θ (θ-invariant for short). We establish an extension of the famous defect theorem. Moreover, we prove that for the so-called thin θ-invariant codes, maximality and completeness are two equivalent notions. We prove that a similar property holds for some special families of θ-invariant codes such as prefix (bifix) codes, codes with a finite (two-way) deciphering delay, uniformly synchronous codes and circular codes. For a special class of involutive antimorphisms, we prove that any regular θ-invariant code may be embedded into a complete one.
Fichier principal
Vignette du fichier
Invariance-Neraud-Selmi.pdf (114.8 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02117030 , version 1 (01-05-2019)

Identifiers

  • HAL Id : hal-02117030 , version 1

Cite

Jean Néraud, Carla Selmi. Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms. Springer, LNCS., 2017, pp.214-227. ⟨hal-02117030⟩
21 View
63 Download

Share

Gmail Mastodon Facebook X LinkedIn More